Dynamic Programming

What is Dynamic Programming?


1.

In computer science, dynamic programming (short: DP) is a method for reducing the runtime of algorithms exhibiting the properties of overlapping subproblems and optimal substructure.

Mathematician Richard Bellman invented dynamic programming in 1953. The field was founded as a systems analysis and engineering topic which is recognized by the IEEE.

The problem looks too hard to solve - it must be dynamic programming!

See dp, greedy, recursion


55

Random Words:

1. a combination of insane and impressive having 500 CDs in your collection is pretty inpressive See Jeph..
1. One of those 8 pound cell phones that resembles a brick. These devices were primarily made by Motorola in the mid to late 1980's. Z..
1. A large man, usually a father with moobs and a fat pouch. Usually has a double chin and a cute face. Often resembles a rabbit or a hamst..