摘要
使用递推技术实现递归问题的算法,不仅可以节省存储空间,而且可以极大地提高算法的执行效率。在对递归问题进行研究的基础上,给出了使用递推技术将递归问题的递归算法转换成非递归算法的具体方法,并通过具体实例加以了说明。
The algorithm of using recurrence to solve recursion problems will save the memory space as well as improve the execution efficiency of the algorithm.In this paper,based on researching the problems of recursion,the specific steps of transforming the recursion to non-recursion algorithm by the method of recurrence are provided,and the concrete examples are raised to illustrate it.
出处
《计算机应用与软件》
CSCD
2011年第3期186-187,194,共3页
Computer Applications and Software
关键词
递推技术
递归问题
分划技术
递推关系
Recurrence technology Recursion problem Partition technology Recurrence relation
