In this video you will learn two fundamental topics in Computer Science: Recursion & Memoization (Dynamic Programming). To cement your learning, we will be using these concepts on two example algorithms; the Fibonacci sequence & the Factorial of a number. For each algorithm, you will learn the standard implementation as well as the recursive implementation which will be used in conjunction with Memoization. With this approach, you will learn the benefits of recursion & Memoization, as well as how they change a normal iterative algorithm.
This entire demonstration will be interspersed with animations. These graphics will give the explanations a visual aid that can make, what would otherwise be complex principles, a lot easier to understand.
📚 Materials/References:
The completed code: replit.com/@LFCProductionsP/F...
🧠 Concepts Covered:
- What Memoization is. Or as some pretentiously call it, dynamic programming.
- How recursive differs from iterative algorithms.
- How to avoid a stack overflow when using recursion.
- How to create a closure in JavaScript & use it to store cached data.
- The iterative & recursive approach to creating both a Fibonacci sequence algorithm & a Factorial algorithm.
💻 Technologies used:
- JavaScript, written on the online IDE, replit.
If you enjoyed this video then please consider liking 👍 and subscribing. You would be doing me a huge favour if you did this and it would be greatly appreciated ❤️ by me. Likewise, if you have any queries or comments that you want answered. Then please, don’t hesitate post them down into the comments box below. I would love to hear back from you and will answer all of your questions to the best of my ability.
Stay awesome guys. ❤️
#JavaScript#ComputerScience#CS#Algorithms#Recursion#Recursive#Memoization#DynamicProgramming#Fibonacci#Factorial#Cache
12 май 2021
