基于递归的程序设计浅析  

Introduction to Recursion-based Programming

作　　者：周法国[1] 

机构地区：[1]中国矿业大学(北京)机电与信息工程学院,北京100083

出　　处：《天津科技》2017年第6期103-105,共3页Tianjin Science & Technology

基　　金：中国矿业大学(北京)课程建设与教学改革项目:计算机专业程序设计语言课程体系建设与教学改革(No.J160406)

摘　　要：递归是一种算法设计的策略,是程序设计和描述算法的一种有力工具,在程序设计中被广泛采用,尤其在数值计算、数据结构、人工智能、算法设计与分析及其他领域应用广泛。通过分析递归程序设计的数学模型归纳法讨论了递归程序设计的一般思想与方法、步骤及需要解决的关键核心问题。最后,通过几个可以采用递归实现的经典算法,详细阐述了通过分析问题,找到递归实现的两个基本核心问题,即递归表达式和递归终止的条件,并以此来编写递归调用的函数。Recursion is a strategy of algorithm design and it also is a powerful tool for programming and algorithm describ- ing. Recursion is widely used in programming. Especially, it is widely used in numerical computation, data structure, artificial intelligence, algorithm design and analysis and other fields. In this paper, through analyzing the mathematical inductive model of recursive programming, the general idea, methods, steps and key problems to be solved were dis- cussed and analyzed in detail. Finally, some classic recursive algorithms were given in this paper. Via finding recursive expression and recursive termination condition, the two key problems in realizing recursion, recursive function could be programmed.

关 键 词：递归 函数 归纳 法程序设计 

分 类 号：G642[文化科学—高等教育学]