"Recursion Never Ends"
This video presents the same text shown beside it, spoken and on screen. It adds nothing the text does not say.
State
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.
Show
A scavenger-hunt clue reading "solve the previous clue first" with no first clue loops forever.
Watch for
A missing base case fails loudly, as an overflow.