onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-04-03 20:23:52 +01:00
Code Issues Packages Projects Releases Wiki Activity
grokking-algorithms/chapter11
History
onyx-and-iris d552050f7e typo
2024-01-19 17:23:09 +00:00
..
camping.py
refactor format_and_print()
2024-01-16 17:19:45 +00:00
knapsack.py
refactor format_and_print()
2024-01-16 17:19:45 +00:00
README.md
typo
2024-01-19 17:23:09 +00:00
subsequence.py
rename vars
2024-01-18 01:18:01 +00:00
substring.py
rename vars
2024-01-18 01:18:01 +00:00
travel.py
refactor format_and_print()
2024-01-16 17:19:45 +00:00

README.md

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.