Lesson 2

# Dynamic Programming Approach

#### Dynamic Programming Approach

Find a minimum cost path from 3 to 2 in the given graph using dynamic programming.

**Answer:**... (more)

Dynamic programming approach is similar to divide and conquer in breaking down the problem into smaller and yet smaller possible sub-problems. But unlike, divide and conquer, these sub- problems are not solved independently. Rather, results of these smaller sub-problems are ...

(more)