基于0/1背包问题的算法探究

0／1背包问题是计算机科学中的一个经典问题。动态规划法，递归法，回溯法是求解该问题的三种典型方法，使用这三种方法求解0／1背包问题，并对各算法进行了理论分析。用不同规模的0／1背包问题对三种算法进行测试，比较它们的运行时间，发现测试结果与其理论分析结果相符．最后指出就求解不同规模的0／1背包问题而言各算法的优劣。

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.