Python3 basis for solving the factorial of a number with function recursion

Town Field Poem:
Cheng listens to the Tathagata language, the world name and benefit of Dayton. Be willing to do the Tibetan apostles, the broad show is by Sanfu mention.
I would like to do what I learned, to achieve a conscience blog. May all the Yimeimei, reproduce the wisdom of the body.
——————————————————————————————————————————

Code

# recursive to call the function itself, all to be pressed stack, the stack. Problem with resource consumption # recursion to have the right termination condition # recursive Risky def f (x):    if x==1:        return 1    else:        return x* F (x-1) print (f (5)) "" "Step 1: Go first. F (5) =5*f (4)    F (4) =4*f (3)        F (3) =3*f (2) F (2)            =2*f (1)                f (1) =1 (return) Step 2: Return by layer F (1) =1 (return)     F (2) =2*f (1)         F (3) =3*f (2) F (             4) =4*f (3)                 F (5) =5*f (4) Finally, we know the result of F (5) "" "

Result

——————————————————————————————————————————
The essence of the blog, in the technical part, more in the town yard a poem. Python version 3.5, System Windows7.
Python is a good language and deserves to be studied hard. I am following the small Turtle Video tutorial to learn, recommended.
I am a novice, so if the content of the blog can be improved, or even the wrong place, please leave a comment, I will try to correct, strive to achieve a conscience blog.
Note: This article is only as a scientific research study, if I inadvertently violated your rights and interests, please be sure to timely inform, I will make corrections.

Python3 basis for solving the factorial of a number with function recursion