-
Dynamic Programming(DP) is a method applied to solve
optimization problems
-
DP, like divide and conquer method, solves problems by
combining solutions to subproblems
-
DP is applicable when sub problems are not
independent, that is, when sub problems share
sub-subproblems
-
Every sub-subproblem is solved just once and the answer is
saved in a table. This avoids the work of recalculating the
answer every time the sub-subproblem is encountered
-
Programming in this context refers to the tabular method
and not to writing computer code