Computer Science / Unit 3 CS 0136 short lesson, about 20 seconds
Brute Force
Captions available
The idea
A brute-force algorithm solves a combinatorial problem by generating every candidate solution in the space and keeping the best — guaranteed correct, and priced accordingly.
In practice
Listing every possible route between two map points before choosing the shortest works, briefly, on tiny maps.
Where people slip
The guarantee is real; the bill arrives at scale.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
Something wrong in this lesson? Flag it · Sources for Computer Science