What is recursion and what is recursion

The program calls itself called recursion.

Recursion is generally used to solve some of the more troublesome algorithmic problems.

The difference between recursion and loops is that loops focus on the process, while recursive values focus on the results.

To put it simply: what can be achieved with a loop, recursion can generally be achieved, but what can be achieved with recursion, a loop may not be possible. Because some topics only focus on the end condition and the process of the cycle, and often this end condition is not easy to express (that is, it is not easy to write in the loop); Focus only on the number of cycles and not on the start and end conditions of the cycle (this cycle is even more difficult to start).

If you want to understand recursion, you won't be able to figure it out for a while. But writing recursion requires remembering three steps.

1.The first thing to look for is the critical value, which is the value obtained without calculation.

2.Find the relationship between this time and the last time.

3.Assuming that the current function is already available, the call itself calculates the relationship between the previous time and this time.

Recursion is a function that calls itself directly or indirectly. When a certain condition is met, the call ends and returns a specific value.

Recursive algorithmsIt is a process that directly or indirectly invokes its own algorithm. In computer programs, recursive algorithms are very effective in solving a large class of problems, often making the description of the algorithms concise and easy to understand.

Features of recursive algorithm problem solving:Recursion is the call of itself in a procedure or function.

When using a recursive strategy, there must be a clear recursive end condition, known as a recursive exit.

Recursive algorithms are often concise but less efficient to run. Therefore, it is generally not advisable to design programs with recursive algorithms.

In the process of recursive calls, the system opens up a stack for each layer of return points, local quantities, etc. to store. Too many recursions can easily cause stack overflows, etc. Therefore, it is generally not advisable to design programs with recursive algorithms.

1. Recursive algorithm concept:

Inside a function or subroutine, directly or indirectly invoke its own algorithm.

2. Basic information:

A recursive algorithm is a subproblem that transforms a problem into a smaller problem of the same kind. A function or procedure is then recursively called to represent the solution to the problem. A procedure or function that directly or indirectly calls itself is called a recursive procedure or function.

Recursion is a programming technique in which a program invokes itself.

Recursion is widely used as an algorithm in programming languages. A process or function in its definition or description has a direct or indirect call to its own method, it usually transforms a large and complex problem into a smaller problem similar to the original problem to solve, the recursive strategy only needs a small number of programs to describe the number of repeated calculations required by the solution process, greatly reducing the number of programs. The recursive ability of the liquid bridge hood lies in defining an infinite set of objects with a finite number of statements.

In general, recursion requires boundary conditions, recursive forward segments, and recursive return segments. When the boundary conditions are not satisfied, recursively advance; When the boundary conditions are satisfied, recursively returns.