Computer Science / Unit 3 CS 0135 short lesson, about 20 seconds
Divide and Conquer
Captions available
The idea
A divide and conquer algorithm breaks a problem into smaller subproblems, recursively solves each, and combines their results — a paradigm, the shared idea behind many designs.
In practice
A tournament finds its champion by splitting the field, resolving each half, and playing one final.
Where people slip
The combine step can carry real work.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Something wrong in this lesson? Flag it · Sources for Computer Science