On the Algorithm of the 0/1 Knapsack Problem

The 0/1 knapsack problem is a classic problem in the computer science.dynamic programming,recursion and backtracking are three kinds of typical algorithms to solve the 0/1 knapsack problem.It solves the 0/1 knapsack problem through these three methods and provides analysis for each algorithm.Through testing these three kinds of algorithms and comparing their running time under different scale,it find that the result of test tally with that of theoretical analysis,and finally point out the advantage and disadvantage of each algorithm as for solving different scale of 0/1 knapsack problem.