Memoizing Fibonacci Numbers
In this lesson, we are going to reduce the time complexity of the Fibonacci code we wrote using a dynamic programming technique called memoization.
We'll cover the following...
In the last lesson, we introduced the basic concept of dynamic programming and its two patterns: memoization and tabulation.
In the first lesson of this chapter, we established that the recursive implementation of the Fibonacci sequence causes calculations, which result in exponential time ...
Ask