mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-11-15 17:30:52 +00:00
7 lines
251 B
Markdown
7 lines
251 B
Markdown
|
# Dynamic Programming
|
||
|
|
|
||
|
|
A programming technique for decomposing a problem into smaller discrete subproblems.
|
||
|
|
|
||
|
|
- Useful when trying to optimize something given a constraint.
|
||
|
|
- Example, items in a knapsack of size W that gives the greates value.
|