| 递归算法设计及效率分析 |
| |
| 引用本文： | 袁劲松,杨伟明.递归算法设计及效率分析[J].计算机与数字工程,2007,35(2):25-27. |
| |
| 作者姓名： | 袁劲松 杨伟明 |
| |
| 作者单位： | 广东纺织职业技术学院自动化系,佛山,528041 |
| |
| 摘 要： | 递归算法是非常常用和实用的程序设计方法，递归算法的效率问题值得去研究，给出针对递归算法的一般性分析方法：递推式计算法和递归调用树法，并通过实例加以说明。
|
| 关 键 词： | 递归 时间复杂度 递推式 |
| 修稿时间： | 2006年3月27日 |
Design and Analysis of Efficiency for the Recursion Algorithm |
| |
| Yuan Jinsong,Yang Weiming.Design and Analysis of Efficiency for the Recursion Algorithm[J].Computer and Digital Engineering,2007,35(2):25-27. |
| |
| Authors: | Yuan Jinsong Yang Weiming |
| |
| Affiliation: | Yuan Jinsong |
| |
| Abstract: | 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. |
| |
| Keywords: | recursion complicacy of time recursive expression |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
