mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2026-01-02 03:07:47 +00:00
251 B
251 B
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.