According to the features of the existed algorithms of 0-1 knapsack problem,a new non-recursive algorithm is formally derived in the paper.
针对目前求解0-1背包问题算法的优缺点,开发了一种新的非递归算法。
参考来源 - 0·2,447,543篇论文数据，部分数据来源于NoteExpress
通常，非递归算法要保存返回地址，使程序能继续正确执行。
Usually, return address must be saved for continuing a right execution of the program in no recursion version.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
对使用形式化方法及循环不变式开发新策略开发非递归算法作了较深入的实践和探讨。
The paper contributes to developing non-recursive algorithm using formal method and new strategy of developing loop invariant.
应用推荐