摘要
递归是一种自然地实现分而治之解决问题的编程技术。本文从函数调用机制出发 ,深入讨论了递归的调用过程。
Recursive is a kind of programming technique which can realize the divide-and-conquer method naturally。Starting from the excitation mechanism of function call,the author discusses the process of recursive call 、whether or not to realize recursive and how to program with recursive technique。
出处
《盐城工学院学报（自然科学版）》
CAS
2004年第3期34-36,共3页
Journal of Yancheng Institute of Technology:Natural Science Edition
关键词
递归
栈
函数
函数调用
算法
分而治之
recursive
stack
function
function call
analysis
divide-and-conquer
