| 递归算法的非递归实现 |
| |
| 引用本文： | 蒋晖.递归算法的非递归实现[J].常州轻工职业技术学院学报,2006(2). |
| |
| 作者姓名： | 蒋晖 |
| |
| 作者单位： | 江苏常州轻工职业技术学院 江苏常州213164 |
| |
| 摘 要： | 递归因为其简单清晰、可读性好、可理解性强、易于实现而具有很高的理论价值,但是递归过程中要保存大量有用及无用的数据,因此程序效率不高。该文分析了递归问题的非递归实现三种方法,这三种方法对提高程序的运行效率有很强的作用。
|
| 关 键 词： | 递归 递归算法 非递归算法 堆栈 |
Non-recursive Realization of Recurrence Algorithm |
| |
| Authors: | Jiang Hui |
| |
| Institution: | Changzhou Institute of Light Industry technology Changzhou Jiangsu 213164 |
| |
| Abstract: | Because of its simplicity, readability, intelligibility and easy realization, recursion has a useful theoretical value. But there involves a lot of useful and useless data to be saved in recursive procedure, so it's efficiency is not very well. The author analyzes three different ways for non-recursive realization of recursive algorithms. These three ways can greatly increase the efficiency for programming. |
| |
| Keywords: | Recursion recursive algorithm non-recursive algorithms stack |
| 本文献已被 CNKI 等数据库收录！ |
