2 articles
The base case, the call stack, and why naive recursive Fibonacci is exponential until one cache makes it linear.
How halving the search space every step turns a million possibilities into twenty comparisons.