10.3969/j.issn.1002-137X.2001.08.022
递归算法的非递归化研究
The method of transforming a recursive algorithm into non-recusive algorithm is discussed in this paper, which is based on the typical questions: Fibonacci series, Ackermann-functuin, Hanoi tower problem and Traversing binary tree etc. in the same time ,the characteristics and executing efficiency of recursive algorithm and non-recursive algothm are also discussed.
Recursion、Algorithm、Non-recursive algorithm
28
TP3(计算技术、计算机技术)
2004-01-08(万方平台首次上网日期,不代表论文的发表时间)
共3页
96-98