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:

Zoobomb
1. A group in Portland, Oregon that rides jankity little kids bikes down huges hills every Sunday night. Famous for their bike art--the cha..
Read more
Equalize
1. to disarm / halt / tear into the opponent. all together reinforce the fact that YOU are THE BOSS. used in Forgetting Sarah Marshall: ..
Read more
Nahj
1. Lit. No. Oft. used lazily, but not necessarily so. "Yo, lets go jump off this building." "Nahj, man. I'm good her..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free