Computer Science / Unit 2 CS 0056 short lesson, about 20 seconds
"Recursion Never Ends"
Captions available
The idea
Recursion without a base case never terminates — the base case is the smallest instance answered directly, the floor that makes a recursive process an algorithm.
In practice
A scavenger-hunt clue reading "solve the previous clue first" with no first clue loops forever.
Where people slip
A missing base case fails loudly, as an overflow.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Something wrong in this lesson? Flag it · Sources for Computer Science