【摘要】 针对动态规划在0-1背包问题中求解最优值时的教学难度,结合教学过程和特点,对计算最优值的算法进行了改进,在与最优值递归公式保持一致的情况下简化了迭代过程,消除算法技巧,增加了算法的规范性和连贯性,收到了理想的教学效果。更多还原

【Abstract】 Given all the difficulties in teaching about using dynamic programming to find the optimal value for the 0-1 knapsack problem,we improved the algorithm for optimal value calculation in combination with the process and characteristics of teaching.With the consistence with the recursive formula for the optimal value maintained,we simplified the iterative process and removed algorithm skills,thereby increasing the compliance and the coherence of the algorithm and hence receiving better teaching results.更多还原