递归算法的应用与分析  

Application and Analysis of Recursive Algorithm

作　　者：倪锦园 张建勋[1] NI Jinyuan;ZHANG Jianxun(College of Computer Science and Engineering,Chongqing University of Technology,Chongqing 400054,China)

机构地区：[1]重庆理工大学计算机科学与工程学院,重庆400054

出　　处：《现代信息科技》2020年第20期146-148,152,共4页Modern Information Technology

基　　金：重庆市教委科技研究重点项目(KJZD-K201801901)。

摘　　要：递归思想是算法分析设计中最重要的思想之一,递归算法应用十分广泛,借助递归算法可以把一些较为复杂的问题简洁地表示出来。该文重点介绍了递归算法的概念和三个特点,通过计算机博弈树详细说明了递归算法在数据结构中树的应用,使用点格棋博弈过程落子的不同状况系统地介绍了递归算法在图的应用,并通过对照实验重点分析了递归算法和递归算法非递归化的执行效率。Recursive thought is one of the most important thoughts in algorithm analysis and design.Recursive algorithms are widely used.With the help of recursive algorithms,some more complex problems can be expressed concisely.This article focuses on the concept and three characteristics of the recursive algorithm.This paper describes the application of recursive algorithm in data structure tree in detail through computer game tree,systematically introduces the application of recursive algorithm in graph by using different situations in the process of point chess game,and analyzes the execution efficiency of recursive algorithm and recursive algorithm non recursive through contrast experiments.

关 键 词：递归 算法 非递归化 效率 

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