Recursion and Memoization Tutorial Python

What is recursion? What is memoization? Today I do a Recursion and Memoization Tutorial in Python.

In this video I explain a programming technique called recursion. This is the practice of making a function call to the function it is declared in. You do this to continue to simplify a problem until you are at a base case in which you can know how to solve. However this can be quite slow so to speed up the process you use memorization. This stores all the answers you've already calculated in a hash table where they can be referenced later.

Please let me know how my explanation was and it there was anything I did wrong.

Please LIKE and SUBSCRIBE for more content!

Tags:
- recursion tutorial
- recursion and memoization
- recursion explained
- what is recursion
- how to do recursion
- recursion tutorial python

[TheBeginningOfMusic]

Almost the 1 year anniversary of this video, I'd love to see another recursion problem solving video! Keep up the amazing work! :)

[yohannes-]

i printed the value with n = 7 and the dictionary which is 13 and
{3: 2, 4: 3, 5: 5, 6: 8, 7: 13} respectively. but I can't understand how it prevents calculating more than once. it would be better if you insert one number and show us how it is put in dict and the dict helps in memoization process

[akira_asahi]

Thank you for the video. I am grateful for your time and contribution. Kind regards, Akira.

[OmerMan]

I thought the dictionary should be inside the function 🤔
How does it work?

[ribusgan]

I have a small question. A dictionary needs a "key : value" pair. But it seems that the only thing which goes into the dictionary is one value at a time. How do the elements (key : value pairs) look like in the "nums" dictionary?

[ffccardoso]

why you didn't finish the program!

or tested big numbers with her...

so unsatisfactory...