What are the characteristics of Python recursion

This article mainly talks about "what are the characteristics of Python recursion". Interested friends may wish to have a look at it. The method introduced in this paper is simple, fast and practical. Let's let the editor take you to learn what are the characteristics of Python recursion.

Three laws of recursion

When you want to use recursion to solve a problem, you need to consider whether these three conditions are met:

The basic end condition of recursion (i.e. the minimum size problem)

The recursive algorithm must meet the requirement of changing the state in the direction of scale reduction, that is, evolving to the basic end condition.

The recursive algorithm must call itself

Note: recursive calls automatically generate a recursive stack that takes up memory space, and the recursive stack is limited in size.

The characteristics of recursion

Recursion in some cases, instead of iterative recursive algorithms, recursive algorithms usually fit naturally with the expression of the problem, and recursion sometimes leads to a huge amount of repeated computation.

The "memory technique / function value caching technique" is usually used to record the intermediate results, and determine whether it has been calculated before recursion, and if it is repeated, it will directly return the stored optimal solution to avoid repeated calculation.

There is a certain relationship between dynamic programming and recursion, and problems that can usually be solved by dynamic programming can be solved by recursion.

Recursion is from top to bottom and evolves towards a smaller scale.

On the contrary, the dynamic scale is recursive from the minimum scale to the solution of the target scale.

At this point, I believe you have a deeper understanding of "what are the characteristics of Python recursion". You might as well do it in practice. Here is the website, more related content can enter the relevant channels to inquire, follow us, continue to learn!