Recursion Deep-Dive
📋 What it is
Recursion solves a problem by solving a smaller version of the SAME problem, until it’s tiny enough to solve directly.
🗣️ Coach says
Recursion is “to do this big thing, first do a smaller copy of this same thing.” It needs two parts: the shrink step (make it smaller) and the BASE case (the tiniest version you solve directly), or it loops forever.
🧠 Memory hook
Recursion = shrink the problem + a base case to stop. No base case = forever loop.
😂 Giggle
Why did the assumption get in trouble?
Because it snuck into the puzzle without being checked!
😲 Whoa!
Recursion is how a single short instruction can describe an endless pattern — it’s used to draw fractals, sort huge lists, and even how your computer draws nested folders.
✅ Quick check: Why does every recursion need a “base case”?
Say your answer out loud first — then reveal.
Without a base case (a smallest version you solve directly), it keeps shrinking and calling itself forever and never stops.
The base case is the stopping point that ends the recursion.
🧪 Try it! (2 minutes)
Explain how to eat a giant sandwich “recursively”: take one bite, then eat the smaller sandwich; base case = no sandwich left.