一个递归算法非递归化的算法框架  

AN ALGORITHM FRAME FOR CONVERTING RECURSIVE ALGORITHMS TO NON-RECURSIVE ONES

作　　者：杨春花[1] 姚进[1] 赵培英 姜合[1] 

机构地区：[1]山东轻工业学院信息科学与技术学院,山东250353

出　　处：《计算机应用与软件》2010年第9期81-84,共4页Computer Applications and Software

基　　金：山东省科技厅科技攻关项目(2006GG2201009)

摘　　要：虽然递归算法具有结构简练、清晰、可读性强等优点,但有时受执行效率和程序设计语言的限制,必须实现递归向非递归的转换。提出一个通用的算法框架实现一般递归算法向非递归算法的转换。该框架产生的非递归算法没有标号,适用于大多数程序设计语言。结合几个典型的实例说明该框架的应用方法和有效性。Although recursive algorithms have advantages of simple, clear and high readable structures, they must be converted to corre- sponding non-recursive counterparts, for sometimes they are to be limited by the running efficiency and programming languages. A universal algorithm frame is given in the paper for realising the conversion of general recursive algorithms to non-recursive ones. The non-recursive algo- rithms converted by this frame have no label statements, so it is suitable to be applied to most of programming languages. Several typical examples illustrated its usage and effectiveness.

关 键 词：递归算法 非递归算法 转换 框架 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]