Dynamic programming is both a mathematical optimization method and a computer programming method. If sub-problems can be nested recursively inside larger problems, so that dynamic programming methods are applicable, then there is a relation between the value of the larger problem and the values of the sub-problems. In the optimization literature this relationship is called the Bellman equation.
There are two ways in which we can apply the paradigm of Dynamic Programming:
1. Top down Approach
2. Bottom up Approach
What are you waiting for? Start Learning the course now!
Who this course is for:
- Beginner Programmers
- Beginner Software Developing Aspirants
Coupon expired! Follow us on Facebook to Get Instant Updates
