冒泡和递归

li=[34,12,33,1]
print(li)
for i in range(0,len(li)):
#range开始0 结束len(i)-1
   for j in range(1,len(li)-i):
       if li[j] < li[j-1] :#当前位置比前一个位置则互换位置
           temp = li[j]
           li[j] = li [j-1]
           li[j-1] =temp
print(li)

count = 1 #计数器
def f(a1,a2):
    global count
    count +=1
    print(a1)#打印波菲特数
    if count > 10:
        return
    a3 = a1 + a2
    f(a2,a3)
f(0,1)

def f(depth,a1, a2):
    if depth ==10:
        return a1
    a3 = a1 + a2
    r=f(depth+1,a2, a3)
    return r
ret=f(1,0,1)
print(ret)