The characteristics of recursive programs are: 1. Recursion means calling itself in the method; 2. When using the incremental recursion strategy, there must be a clear recursion end condition, called the recursive exit; 3. Problem solving usually appears It is very simple, but the operating efficiency is low; 4. During the recursive call process, the system opens a stack to store the return points, local quantities, etc. of each layer.
The operating environment of this tutorial: Windows 7 system, Dell G3 computer.
Recursive program refers in computer science to a program that solves a problem by repeatedly decomposing the problem into similar sub-problems. Recursive methods can be used to solve many computer science problems, so it is a very important concept in computer science. Most programming languages support self-calling of functions, where a function can recurse by calling itself. Computing theory can prove that the role of recursion can completely replace loops, so it is customary to use recursion to implement loops in many functional programming languages (such as Scheme).
Features:
1) Recursion is calling itself in the method.
2) When using the incremental recursion strategy, there must be a clear recursion end condition, called the recursion exit.
3) Problem solving usually appears very concise, but the operating efficiency is low. Therefore, it is generally not recommended to use recursive algorithms to design programs.
4) During the recursive call process, the system opens a stack to store the return points, local quantities, etc. of each layer. Too many recursions can easily cause stack overflow, etc. Therefore, it is generally not recommended to use recursive algorithms to design programs.
For more programming-related knowledge, please visit: Programming Teaching! !
The above is the detailed content of What are the characteristics of recursive programs?. For more information, please follow other related articles on the PHP Chinese website!