An example of the use of the Knapsack algorithm. Each item has a weight and value and the "knapsack" has a max weight that it can hold. The algorithm's job is to find the combination of items that maximizes the value while maintaining a weight <= to the knapsacks max weight.
-
Notifications
You must be signed in to change notification settings - Fork 0
BeauCranston/KnapsackAlgorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published