Fibonacci Sequence - Anatomy of recursion and space complexity analysis

[@manojpandey7517]

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.😍

[@Bhargavsays]

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

[@indrashishbasu3648]

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

[@kevinz1991]

Same!

[@estevanprado2005]

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

[@SmartProgramming]

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

[@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.

[@anubhavsingh8144]

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

[@randombucket5596]

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

[@sunnyjain630]

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

[@keifer7813]

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

[@nolimits2017]

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.

[@vamsikrishnasayarwar1792]

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

[@Dev_God]

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

[@santiagomarulanda7640]

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

[@indiann871]

Hi! How are you

[@manmeetsingh1194]

Please add the videos for Algorithms same as you did for Data Structure.

[@last_theorem]

sadly he is no more. he expired in an accident

[@AMITSHARMA-oh1nq]

@@last_theorem really!!!

[@last_theorem]

@@AMITSHARMA-oh1nq yea bro. Just Google about it, there is a full article about it in his facebook page as well. Posted by some of his friend. I felt really bad when i got knw about it through a friend . He is really an inspiration the legacy he left is fab.

[@allurisitaramaraju3834]

legends view this vedio one hour before the exam

[@shailjakantupadhyay5183]

great explanation sirji, i am highly thankful to u.

[@pathakotadeepthi1316]

Ur video made my day 🙂.Tq ❤️

[@JayaprasadB-px4vc]

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

[@kevinz1991]

Incredibly clear and helpful thank you so much

[@mehdiichkarrane5059]

Very good explanation. Thank you

[@daniellee3987]

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

[@velevki]

Shouldn't it be F(5) calls F(4) + F(3) and F(4) calls F(3) + F(2) so the implicit stack goes like F(5),F(4),F(3),F(4), F(3),F(2) and so on ?

[@simratchehal6442]

No. since F(5) is calling F(4) first so as soon as we reach F(4), it will leave the function and start making a call to F(4) and then F(4) requires F(3), F(3) requires F(2), F(2) requires F(1), and as soon as it gives F(1) its value i.e. 1 , it will travel in reverse and now since we know F(1) , it will go back to the function where we were finding F(2) which after F(1) now require F(0) i.e. 0 , F(2) would be returned to the function where its call was made. And this goes on. We basically don't keep the called functions on hold so as soon as some function is called, the code would only reverse its direction once it has got the value .

[@velevki]

Simrat Chehal Thanks for the explanation.

[@pallasuryakumar6931]

good explanation. I understood till reaching the f(1) and as value is available for f(1) ,it is traversing back to f(2) .But I can't understand how it is taking f(0) and where it is storing f(0) and similarly the right side functions of + sign when traversing up. Please do reply.

[@m.imranzaheer1368]

Nice explanation 👍

[@TheRedsky92]

Your explanations are fantastic!! Thank you very much!!!

[@chethanvenkataramaiah6940]

after popping 0 and 1 , why does F(2) when called for second time add 0 and 1 , why can't it make a call for f(0) again?

[@Alan-qb9qt]

Marvelous tutorial

[@rajabmuhamedrajab5128]

The best explaination Thanks sir😍

[@gokulnaathb2627]

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

[@t6hp]

My God! This is brilliant!

[@rezafarrokhi9871]

excellent brother.

[@makinenivanshita1292]

Why does F(2) make a call to F(0) instead of F(1)?

[@patriotpatriotic3894]

Very clear and understandable, Thank you!

[@ShibaCat]

I have a great learning by your video! and how about time complexity? any tutorial?

[@iotbuilds4419]

so the more functions are called that create more data in mass over time would be that of a larger space complexity. Even if the time complexity of the code is something of O(1) this is still a phattness problem. Because the expansion of this kind of data creates more problems if not dealt with? Am I interpreting this correctly?

[@dokhangtseringnamgyal8735]

Hats off for the way of explaining, but if anyone can help i have a question :- when, f(4) = f(3) + f(2) then it did got it from f(3) value from stack memory but f(2) already poped out then how did it got value of f(2) Did it received through f(3) ? is it possible that f(3) carries the value of f(2) which is already popped out? thank you help would be great!

[@sasidharnaidu4507]

F(3), would make another call to f(2), and subsequently to f(1). The f(2) will make its own f(1) and f(0) calls.

[@yomamasofat413]

4:46 no but F(5) calls F(4) and F(3) at the same time now? Why the one sided analysis first?

[@kasiviswanath7981]

this is what i want from the youtube

[@dillon4321]

#1 teacher

[@darylfgeorge]

Excellent, thank you very much!

[@killerperk2493]

Awesome video!

[@crummmycheese]

nice way ,this explanation fitted my head

[@malonemathai7963]

where did fib (5) come from??

[@Entertainment-sh4ew]

5 come from user input

[@ryanmanchikanti5265]

we tend to call the pre calculated functions a lot like f2 or f3 f1 is there a way to store the state maybe like a dictionary so that everytime we call it if it's present in the dic we can just return the pre computed value ? can we do that ?

[@sasidharnaidu4507]

Thats called memorization

[@kentmillamena1518]

what if the tree calls(2,6). How would we work this out?

[@Pratikpv]

very nice explanation.. Thanks

[@Maheeky]

Awesome video, thank you

[@derricdani]

I have a doubt. Could you please tell me how F(2) calls F(0) ?

[@shekharsharma3329]

F(2) calls both F(1) and F(0).

[@anmolagrawal9898]

thanks brother

[@avaneeshyadav2005]

Can u plz explain Fibonacci Search ...plz

[@albertndege5596]

well explained

[@sumitkumar-in2si]

अच्छा एक्सप्लेन किया आपने ।

[@SadarHussain-m7w]

very good

[@sirichandana8064]

Sooo..... helpful👌

[@marktonight902]

I see the sequence as reflective knowing

[@shahzaman2089]

v goood explanation. regards

[@maheshvangala8472]

thank you

[@TechAsif24]

thank you sir

[@deboparnabanerjee4185]

the 5th fibonacci number is 3 not 5.

[@ykyjohn]

what about time complexity? :)

[@musabr.5685]

Thanks man...!

[@kodingdemon5074]

thank u sir

[@--ShivaS]

gr8 vedio!!!

[@ChandraSekhar-tr7sf]

expecting python tutorials from u

[@narc7885]

Lmao this was 8 years ago and the founder is working in Google full-time after the co-founder died. 😭 So we can't expect anymore from him. It was a nice journey with the two legends

[@hchemlal]

Time complexity is wrong, it is exponential.

[@mihirvaghela3479]

legend

[@hirakmondal6174]

plssss improve the sound quality... btw the video has helped me a lot... :)

[@imranhosen414]

Your series start from 1 but fibonacci should start from 0.

[@abhishekavr1848]

although it doesn't matters whether you start from one or zero. But since the origin of the sequence was inspired from rabbit population for which u need one male and one female so sequence start from 1 and 1

[@samwinchester3189]

It's good but shouldn't fib(5) eventually return n which value is 6 for 5 is 6th term in a Fibonacci series?

[@joyprokash4013]

Excellent explanation.Thanks a million.