Question

knapscak problem example
​

Answer 1

What is the Knapsack Problem? KNAPSACK PROBLEM is a very helpful problem in combinatorics. In the supermarket there are n packages (n ≤ 100) the package i has weight W[i] ≤ 100 and value V[i] ≤ 100. A thief breaks into the supermarket, the thief cannot carry weight exceeding M (M ≤ 100).