mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2025-10-31 04:21:47 +00:00
7 lines
252 B
Markdown
7 lines
252 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 greatest value.
|