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:

Double-glazing
1. a spectacled person check out Professor Stephen Hawking over there. that guy's got some serious double-glazing...
Read more
Rafter
1. Misplaced Canadian with a penchant for crazy marketing schemes. Lover of pizza and all things Richard. Will sell his soul for one more p..
Read more
¯o_°/¯
1. An expression of uncertainty. See ¯(°_o)/¯ ¯(o_°)/¯ I do not know, good sir. See emoticon, emote, smiley, shrug, *shrug*..
Read more

Best StartPage for your browser.

All you need for a faster workflow in one place.



Get it for Free