Fibonacci Sequence - Anatomy of recursion and space complexity analysis

See complete series on recursion here

In this lesson, we will try to see how recursion executes in computer's memory and try to analyze memory consumption of a recursive program using the example of Fibbonacci sequence in mathematics.

Prerequisite: basic knowledge of recursion as a programming concept.

[Bhargavsays]

When it comes to "My code school", it never disappoints me.

[manojpandey]

I must say that this was the height of brilliance in teaching the basics of how space is utilized when a function is called. I was overwhelmed by the way you explained it. This cleared a lot of fog off my road. This was truly the anatomy of recursion. Thank you @mycodeschool if you're reading this.😍

[estevanprado]

11 years later and this video still has tremendous value, thank you for clearing the clouds...

[indrashishbasu]

One of the best explanations of function call stack utilization I have ever seen! Thank you :-)

[ShadowsMasquerade]

Awesome explanation. I find it very interesting that the resulting 'tree' from the recursion visually shows how it branches off into the parts of the summation, which then appear on the left-most (max depth level) branch as the Fibonacci sequence.

[anubhavsingh]

I am watching it in 2021, u know it still worth it, thank you profoundly

[nolimits]

Thank you so much. A lot of youtube videos have the space complexity analysis of the fibonacci sequence wrong. This helped me understand recursion a lot more.

[Dev_God]

Thank you! It's so lucidly explained and now I finally could understand what's going on during debugging.

[vamsikrishnasayarwar]

Best Explanation of function call stack I have ever seen. Thank You

[SmartProgramming]

wow deeply explained, you are doing a great job sir, stay blessed 👍👍🙂

[randombucket]

I looked for many videos, this one is the one that helped me, thanks

[sunnyjain]

please add more videos on Dynammic Programming....!most appreciated!!

[keifer]

This was fantastic. Thank you. It's a lot more clear to me now

[santiagomarulanda]

Que buena explicación, justo lo que estNa buscando. Thank you so much!!! 😊

[allurisitaramaraju]

legends view this vedio one hour before the exam

[shailjakantupadhyay]

great explanation sirji, i am highly thankful to u.

[kevinz]

Incredibly clear and helpful thank you so much

[daniellee]

great explanation, the recursion tree illustration is very intuitive...can you give some recursion tutorial video on combination, permutation and graph traversal? I believe your graph traversal recursive algorithm video would be an excellent compliment to your graph data structure video...cheers

[JayaprasadB-pxvc]

Fibnoacci series recursive call space complexity is : O(n)
Time complexity is : O(2^n)

[gokulnaathb]

Thank you so much, Sir, I understood recursion, function call stack, and all properly, thanks a lot <3