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