递归调用算法的研究与解析  

Research and Analysis of Recursive Calling Algorithms

作　　者：官恒 张玉婷 GUAN Heng;ZHANG Yuting(Guangzhou College of Technology and Business,Guangzhou 510850,China)

机构地区：[1]广州工商学院,广东广州510850

出　　处：《佳木斯大学学报（自然科学版）》2024年第7期31-33,共3页Journal of Jiamusi University：Natural Science Edition

摘　　要：每一位初入编程的学习者都会遇到递归调用算法;同时,递归思想也是算法分析中的一个重要的思想。递归算法的应用非常广泛,借助递归调用可以将一个复杂的问题分解为若干个更为简单的小问题。借助C语言程序与高等数学的知识与思想,对递归调用进行分析。将递归调用算法用通俗易懂的方式进行阐述。Every beginner in programming encounters recursive algorithms;meanwhile,recursive thinking is also an important concept in algorithm analysis.The application of recursive algorithms is extensive,as recursive calls can decompose a complex problem into several simpler sub-problems.This article analyzes recursive calls using knowledge and ideas from C programming and advanced math-ematics,elucidating recursive algorithms in a clear and understandable manner.

关 键 词：递归算法 回溯 函数的定义 栈 参数 返回值 

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