How to implement Recursion in python

This article will explain in detail how to achieve recursion in python. The editor thinks it is very practical, so I share it with you as a reference. I hope you can get something after reading this article.

The simplest example of recursion

#-*-coding:utf-8-*-# divides 10 by 2 until the quotient is 0, and outputs the value of the quotient obtained each time in the process. Def recursion (n): v = nAccord 2 # floor except, keep the integer print (v) # every time the quotient is calculated, the value of the output quotient if vested zero:''when the quotient is 0, stop, return Done''' return' Done' v = recursion (v) # recursive call, call your own recursion (10) # function call within the function

Output result:

5210 this is the end of the article on "how to achieve recursion in python". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, please share it for more people to see.