1) Non-recursive
非递归
1.
Non-recursive Algorithm of Hanoi Tower;
Hanoi塔问题的非递归算法分析
2.
Method for formally developing non-recursive algorithm;
一种形式化开发非递归算法的方法
3.
Formal development of non-recursive algorithm for Hanoi tower;
形式化开发Hanoi塔问题非递归算法
2) non-recursion
非递归
1.
This article discusses how to use queue to make non-recursion algorithm of bit link tree ,It uses the method of sequencestorage bit tree and composes a temporary queue to realize the algorithm and the algorithm enriches the method from recursion tonon-recursion.
讨论了利用队列来生成二叉链表树的非递归算法,通过借助了二叉树的顺序存储方法以及构建一个临时的队列来实现这个算法,该算法的提出丰富了由递归算法转换成非递归算法的方法。
2.
On the analysis of Kongming chess,proposes recursion and non-recursion algorithms based on backtrack for the issue,which works effectively.
对孔明棋求解问题进行分析,提出了基于回溯思想的递归和非递归算法,运行结果表明了算法的有效性。
3) nonrecursive
非递归
1.
This paper uses backtracking method to solve the eight-queens problem, gives a recursive algorithm and a nonrecursive algorithm which have a very clear logical structure,and implements the algorithms with Java language.
采用回溯法解决八皇后问题,给出了逻辑结构清晰的递归算法和非递归算法,并用Java语言加以实
2.
In addition, the paper gives a complete new nonrecursive algorithm which has a very clear logical structure and is equavalent to the law.
本文从Hanoi塔本身的简要说明出发,深刻剖析了该问题的递归解法,揭示了其本质特性,形式化地找出了圆盘的移动规律,从而推导出一种全新的、逻辑结构非常清晰的、与递归解在圆盘移动上完全等效的非递归算法,彻底解决了递归解中由于圆盘数增加使空间用量迅速膨胀而导致的死机问题。
4) non recursive
非递归化
1.
This paper enumerates several implementation methods to convert recursive algorithm into non recursive algorithm, illustrates their features and examples, and also provides the corresponding non recursive algorithms.
本文列出了几类递归算法的非递归化实现方法 ,分别说明了这几类递归算法的特点及算法实例 ,并给出了相应的非递归算
5) nonrecursive set
非递归集
6) non-recursive algorithm
非递归算法
1.
Non-Recursive Algorithm of Postorder Binary Tree Traversal
二叉树后序遍历的非递归算法
2.
The article presents the recursive and non-recursive algorithms of postorded-traversing binary tree.
论述了二叉树后序遍历的递归算法和非递归算法,对递归算法中的工作栈的执行过程做了分析。
3.
Compared with recursive algorithm for binary tree traversing,non-recursive algorithm reduces expenses of function calls,gains performance advantage.
二叉树遍历的非递归算法相对于递归算法,减少了函数调用等开销,具有性能优势。
补充资料：非想非非想处天
1.佛教语。即三界中无色界第四天。此天没有欲望与物质﹐仅有微妙的思想。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条