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 Traversin...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.
