Dynamic programming: Dynamic
programming is an algorithm design method that can be used when the solution to
a problem can be viewed as the result of a sequence of decisions.
The general procedure of dynamic
program:
Dynamic programming is used to solve problems with
the following characteristics:
(i) optimal Sub-structure (Principle of
optimality): An optimal solution to the problem
contains within it optimal solutions to Sub-problems.
(ii) Overlapping sub-problem:
There exist some places where we solve the same sub-problem more than once.
No comments:
Post a Comment