python 基础（2）

1、递归：

def recursion(l):
	if l == 1:
		return 1
	else:
		return l*recursion(l-1)
a = 10
print(recursion(a))

2、斐波那契数列：1,1,2,3,5,8,13…

a = 0
b = 1
while b<100:
	print(b,end=",")
	a,b = b,a+b

3、幂的递归：

def power(x,n):
	if n==0:
		return 1
	else:
		return x*power(x,n-1)
x = 3
num = 4
print(power(x,num))