Enhancing Recursion with Memoization

In this blog, we will go over an example of recursion and how we can use something called memoization to increase the speed of the code. The Fibonacci Sequence If you’ve never heard of it, it’s quite simple, just start with two numbers 0 and 1, and add them together to get the next number in the sequence (yeah, that’ll be 1 once again). Now add the new number with the one just before it to obtain the next number, so 1 + 1 and that is 2.