Mastering Fibonacci: Efficient vs. Inefficient Recursive Methods 🔢

In this video I discuss two different recursive approaches to implement the fibonacci numbers. (good vs. bad performance).

Contents include:
*) A simple ("naive") implementation of the fibonacci numbers
*) Tree recursion
*) Analysis using the substitution model
*) Improving speed by using an iterative aproach (coded recursively!)

This video relates to the following article of my blog: http://livingyourcode.blogspot.com/2016/01/implementing-fibonacci-numbers.html

If you are interested in a more detailed discussion on the above topics, be sure to check out this great resources from MIT press:
Linear recursion and iteration: https://mitpress.mit.edu/sicp/full-text/book/book-Z-H-11.html#%_sec_1.2.1
Tree recursion / fibonacci numbers: https://mitpress.mit.edu/sicp/chapter1/node13.html