EDWIN RIVAS
Knapsack Problem
Suppose you have N types of items of varying size and value but you only have a small knapsack of capacity M
to carry these items. This program finds the combinations of items to choose in order to maximize the total
value of all the items that can be placed in the knapsack.
Enter the size of the knapsack and the number of items in the boxes below and click on the " SUBMIT " buttom.