摘要
以H ano i塔问题为例,分析递归程序运行速度慢的原因,提出一种基于数组的递归算法。该算法可以使计算机程序的计算速度提高到最快。
The Hanoi tower question is used as an example to analyze the causes of slow operation of the recursive routine. A recursive algorithm based on array is presented. As shown by the tests,the recursive algorithm can speed up the computational speed of procedure.
出处
《广西科学院学报》
2005年第4期202-203,共2页
Journal of Guangxi Academy of Sciences
关键词
递归
算法
数组
recursion, algorithm, array
