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. An Asus eee pc is tiny, awesome and has a few trickable outable features... however: This laptop may be cool and look cooler but it com..
1. Another word for the 'Oyster Cards' the blue plastic cards used to travel in place of tickets on London underground and busses..
1. The illistration of a better thought.One who knows better than another.One who doesn't give into childish games. "Not the only..