Dynamic
programming:
Dynamic programming is an algorithm design method that can be used when a
solution to the problem is viewed as the result of sequence of decisions.
The
important features of dynamic programming:
(i)
Optimal solutions to sub problems are retained so as to avoid recomposing their
values.
(ii)
Describe sequences containing sub sequences that are sub optimal are not
considered.
(iii)
It definitely given the optimal solution always.
(iv)
Optimality should be checked at all levels.
(v)
Time and space requirements are high, since storage is needed for all level.
No comments:
Post a Comment