使用递推解决递归问题的研究与应用  

RESEARCH ON SOLVING RECURSION PROBLEMS BY RECURRENCE TECHNOLOGY AND ITS APPLICATION

作　　者：陈瑞环[1] 杨庆红[1] 姚兴[1] 

机构地区：[1]江西师范大学计算机信息工程学院

出　　处：《计算机应用与软件》2011年第3期186-187,194,共3页Computer Applications and Software

摘　　要：使用递推技术实现递归问题的算法,不仅可以节省存储空间,而且可以极大地提高算法的执行效率。在对递归问题进行研究的基础上,给出了使用递推技术将递归问题的递归算法转换成非递归算法的具体方法,并通过具体实例加以了说明。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.

关 键 词：递推技术 递归问题 分划技术 递推关系 

分 类 号：TP311.1[自动化与计算机技术—计算机软件与理论]