2 articles
The base case, the call stack, and why naive recursive Fibonacci is exponential until one cache makes it linear.
Why naive recursive Fibonacci takes billions of calls, how remembering answers collapses it to n, and how the same trick solves edit distance and knapsack.