Shulou(Shulou.com)06/02 Report--

This article mainly explains "what is python tail 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 is python tail recursion"?

What is recursion?

Recursive function you must have written, when the school class, it is estimated that the first example is the Fibonacci series. For example:

Int Fibonacci (n) {if (n < 2) return n; return Fibonacci (n-1) + Fibonacci (n-2);}

In short, a recursive function calls itself "recursively" in a function. When writing a recursive function, one thing to note is the end condition of the recursive function. It is true that using recursive functions can simplify the implementation of many algorithms, such as common binary tree traversal. But often when writing recursive functions, the most common problem is the so-called "stack overflow".

Why is there a "stack overflow"? Because the process of function call, we have to use the storage structure of "stack" to save some state at run time, such as the copy of variables in the process of function call, the address of function call and so on. The "stack" often has limited storage space, and when its storage space is exceeded, it will throw the famous exception / error "StackOverflowError".

Take a simple addition as an example, for example:

Int sum (int n) {if (n)

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.