Think Recursively: Base & Recurse
Break a problem into smaller copies.
What Recursion Means
Recursion is a function that solves a problem by calling itself on a smaller piece, until the piece is tiny enough to answer directly. 🌀
Trust the Smaller Copy
The key mindset is the leap of faith: assume the recursive call already works on the smaller input, then build your answer on top of it.
All lessons in this course
- Think Recursively: Base & Recurse
- Generate All Subsets
- Permutations and the N-Queens Idea
- Prune to Survive the Time Limit