计算机与现代化 ›› 2011, Vol. 1 ›› Issue (1): 25-4.doi: 10.3969/j.issn.1006-2475.2011.01.007

• 算法分析与设计 • 上一篇    下一篇

递归问题的非递归实现方法的应用研究

单学广,杨庆红,焦 莉   

  1. 江西师范大学计算机信息工程学院,江西 南昌 330022
  • 收稿日期:2010-07-05 修回日期:1900-01-01 出版日期:2011-01-20 发布日期:2011-01-20

Application Research on Recursion Question’s Nonrecursion Realization Method

SHAN Xue-guang, YANG Qing-hong, JIAOli   

  1. College of Computer and Information Engineering, Jiangxi Normal University, Nanchang 330022, China
  • Received:2010-07-05 Revised:1900-01-01 Online:2011-01-20 Published:2011-01-20

摘要:

使用非递归方式实现递归问题的算法程序,不仅可以节省存储空间,而且可以极大地提高算法程序的执行效率。本文将递归问题分成简单递归问题和复杂递归问题;简单递归问题的非递归实现采用递推技术加以求解,复杂递归问题则根据问题求解的特点采用两类非递归实现算法,使用栈加以实现。

关键词: 递归问题, 递推技术, 回溯, 算法, 堆栈

Abstract:

Using the nonrecursion way to realize the recursion question algorithmic routine, not only may save the memory space, but also may enhance the algorithmic routine to carry out the efficiency enormously. The problem of recursion is divided into the simple recursion question and the complex recursion question; the complex recursion question uses two kinds of nonrecursion algorithm according to the character of the question, and uses the stack to accomplish.

Key words: problem of recursion, technology of recurrence, recollection, algorithms, stack