This program was made for Dr. Niu's algorithm class.
-
Updated
May 27, 2020 - HTML
This program was made for Dr. Niu's algorithm class.
We have a set of items, each with a weight (Wi) and a value (Vi), determine the number of each item included in a collection so that the total weight is less than or equal to a given limit of knapsack and the total value is as large as possible.
Add a description, image, and links to the knapsack topic page so that developers can more easily learn about it.
To associate your repository with the knapsack topic, visit your repo's landing page and select "manage topics."