Fibonacci Numbers are a prime subject for dynamic programming as the traditional recursive approach makes a lot of repeated calculations. In these examples I will be using the base case of f(0) = f(1) = 1.
Here is an example recursive tree for fibonacci(4), note the repeated computations:
Non-Dy...
