Learn python-- recursive function

Recursion: function calls itself directly or indirectly

Recursive process in two

　　1, calling down the decomposition process

　　2, back up, integrated process

Recursive conditions:

　　Conditions must be ended

Example: factorial:

1 def fun_a(n):
2     #print(n)
3     if n == 1:
4         return 1
5     return n*fun_a(n-1)
6 rst=fun_a(5)
7 print(rst)

120

　　Fibonacci columns:

1 def fib(n):
2     if n ==1 or n == 2:
3         return 1
4     return fib(n-1)+fib(n-2)
5 ss= fib(10)
6 print(ss)

55
[Finished in 0.1s]