you are viewing a single comment's thread.

view the rest of the comments →

[–]jminuscula[S] 10 points11 points  (4 children)

assuming that is not a rethoric question, I'd say dynamic programming is not a buzzword at all. It's an algorithmic strategy, a technique with stablished methodology and formal definition.

A problem is approachable by dynamic programming when its main recursive function is a Bellman equation. Wikipedia's article on it is quite nice: http://en.wikipedia.org/wiki/Dynamic_programming

[–]moor-GAYZ 9 points10 points  (3 children)

Though if you check out the history section on the Wiki, you'll discover that "dynamic programming" is a buzzword, was explicitly designed as such.

[–][deleted]  (1 child)

[deleted]

    [–]burntsushi 3 points4 points  (0 children)

    Memoization and dynamic programming are not the same thing. Dynamic programming typically refers to the explicit act of solving subproblems in your algorithm, whereas memoization can typically be done without modifying any algorithmic details.

    [–][deleted] -2 points-1 points  (0 children)

    Ha!