onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-04-03 12:13:52 +01:00
Code Issues Packages Projects Releases Wiki Activity
7e44b37850
grokking-algorithms/chapter_11/README.md
onyx-and-iris 4cd7bb7d18 reorganise directories 
upd chapter_01/binary.py
2025-03-26 01:27:35 +00:00

252 B
Raw Blame History

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.