The paper contributes to developing non-recursive algorithm using formal method and new strategy of developing loop invariant.
对使用形式化方法及循环不变式开发新策略开发非递归算法作了较深入的实践和探讨。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
The realizing recursive algorithm by stack and the Changing recursive algorithm into non-recursive by stack operation are studied. The thinking of recursion and its application are expounded.
分析递归算法的栈实现以及用栈运算转换递归算法为非递归算法，阐述递归思想及其应用。
应用推荐