摘要
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.
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.
出处
《计算机科学》
CSCD
北大核心
2001年第8期96-98,共3页
Computer Science
