摘要
递归算法是非常常用和实用的程序设计方法,递归算法的效率问题值得去研究,给出针对递归算法的一般性分析方法:递推式计算法和递归调用树法,并通过实例加以说明。
The recursion algorithm is a kind of program design method, which is practical and used frequently. Its efficiency question is worth studying. This article presents the generality method to analyze recursion algorithm: the recursive expression computation method and the recursion transfer tree method, and performs them through examples.
出处
《计算机与数字工程》
2007年第2期25-26,41,共3页
Computer & Digital Engineering
关键词
递归
时间复杂度
递推式
recursion, complicacy of time , recursive expression
