Dynamic Programming

From NovaOrdis Knowledge Base
Revision as of 21:49, 11 November 2021 by Ovidiu (talk | contribs) (Created page with "=External= =Internal= =Overview= Dynamic programming algorithms are optimized recursive algorithms, where we store the solution of smaller subproblems and use them in computin...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

External

Internal

Overview

Dynamic programming algorithms are optimized recursive algorithms, where we store the solution of smaller subproblems and use them in computing the solution for larger subproblems, avoiding duplicate work and yielding superior running times. The classic example where the difference between the straightforward recursive solution and the corresponding dynamic programming solution is obvious is computing Fibonacci numbers.