onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

typo

Browse Source
This commit is contained in:
onyx-and-iris 2024-01-19 17:23:09 +00:00
parent 1da4a16ec8
commit d552050f7e
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter11/README.md
View File

@ -3,4 +3,4 @@
A programming technique for decomposing a problem into smaller discrete subproblems. A programming technique for decomposing a problem into smaller discrete subproblems.
- Useful when trying to optimize something given a constraint. - Useful when trying to optimize something given a constraint.
- Example, items in a knapsack of size W that gives the greates value. - Example, items in a knapsack of size W that gives the greatest value.