Dynamic Programming

Dynamic programming is mainly used to provide optimization for recursion. In the recursive solution, if we are using the function with the same parameters, we can avoid re-computation with dynamic programming. The concept in dynamic programming is to store the subproblem solution and use it in a later part of processing.

We can understand dynamic programming by getting the i^th Fibonacci number.

The Fibonacci series contains numbers that have the following relation:

$$F(n) = F(n-1) + F(n-2)$$ ...