結果 : time complexity of 0 1 knapsack problem using dynamic programming