Computer Science / CS 0056 · Atom · ~20 seconds
"Recursion Never Ends"
Video not yet published
to the StudyWalks catalog
to the StudyWalks catalog
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.