# 冒泡排序算法，每一次比较把大的值往上冒

代码块

a = [100,89,7,6,45,99,22,788,0,63,9]
#冒泡排序
for i in range(len(a)):
    for i in range(len(a) - 1):#一次循环数值大的顶上  且每次循环的len（a）长度小1
        test = 0
        if a[i] > a[i+1]:
            test = a[i+1]
            a[i+1] = a[i]
            a[i] = test


#递归斐波那契数列
def f(i,a,b):
    print(a)
    if i == 10:
        return
    c = a+b
    f(i+1,b,c)
f(1,0,1)