dynamic programming 0-1 Knapsack Problem Given weights and values of n items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack.
