Fibonacci Sequence - Recursion with memoization

See complete series on recursion here
This tutorial explains the concept of recursion with memoization which is an optimization technique for improving the performance of recursive algorithms.

Prerequisites: Functions, arrays and basic understanding of recursion as a programming concept.

[sriramsridhara]

you just write the most elegant and beautiful code. no nonsense to the point. can't believe this video is 10 years old.

[psychoticgamer]

8 years later...
Still video is still lit 🔥 and useful
TYSM ✨

[adventurer]

I love the way you illustrated the difference in recursive calls in the trees. It helped the information click!

[PranavNS]

Thank you for the clear and concise explanation of memoization. One can easily "feel" the time complexity while using primitive recursion approach as well as the memoization approach with the demo.

[shinable]

After 8 years I am watching this video! Its pity that you are not teaching anymore!

[shamimsarker]

The best Programming Video till now in my life. Love and Respect from #Bangladesh..

[arslanahmedqureshi]

Just an idea : You guys can use vector push the calculated value in the vector. on the condition point check the vector size if it is larger or equal to n-1 then return the nth value. it will keep the space complexity n..

[pythagoras]

thank you so much. i am watching this after 11 years!!!!

[urvashiandrishi]

Why dont you write a book? I feel that would be great !

[liyaboleo]

great video. I think this video can also be named "Dynamic Programming" since the core concept is the same.

[lofi_ish]

i am so thankful to have come across this vid.

thank you so much. you literally saved my gpa

you are the best.

idk what you are doing right now but i hope you are happy.

[saarcarmi]

Isn't it called Dynamic Programming?

[michaeluchida]

Thank you. A great intuitive use of the memoize function.

[giangkhuat]

thank you so much !! you should be a professor sir

[BhaveshAgarwal]

You are doing a wonderful job nayan ! Keep it up !

[ankittathe]

Really learned something new... thank code school

[SmartProgramming]

very deeply explained, thanks for this tutorial sir, best wishes 👍👍

[bondjames]

I've found that you can only go up to the 46th term because after that the numbers are too big to be stored in the primitive data types int or long, so is there a way to store numbers that are extraordinarily large?

[ShubhamGupta]

please make some tutorial-videos on dynamic programming too !!!..

[SinghHarmanat]

F(5) is returning 5 in this program
But the fifth element in the series 0 1 1 2 3 5 8
is 3
Fibonacci series start from 0.
Am I missing something?