...
/Introducing Dynamic Programming with Fibonacci Numbers
Introducing Dynamic Programming with Fibonacci Numbers
In this lesson, we'll use a dynamic programming technique called memoization to reduce the time complexity of the Fibonacci function.
We'll cover the following...
We are now going to use a dynamic programming technique to reduce the time complexity to linear.
What is dynamic programming?
Dynamic programming algorithms solve problems by combining results of subproblems, just like in the divide and conquer algorithms.
Characteristics
Most problems that can be solved with dynamic programming can also be solved with a divide and conquer approach. The difference between the two is that the dynamic ...