Python
Recursion: How It Works
A recursive function calls itself on a smaller version of the problem until it reaches a case it can answer directly. Every one needs a base case and...
Recursion
Base cases, recursive calls, the call stack, classic recursive problems and their limits.
2 notes
Notes
Python
Recursive Problems and Their Limits
Fibonacci shows why naive recursion can be catastrophically slow, memoisation fixes it in one line, and some problems are worth the stack frames while...