冒泡，递归

　　冒泡排序法

li = [2, 1, 5, 3, 9, 7, 8, 6]
for j in range(1, len(li)):
    for i in range(len(li) - j):
        if li[i] > li[i + 1]:
            temp = li[i]
            li[i] = li[i + 1]
            li[i + 1] = temp
print(li)

　　递归算法

#递归
def death(a1, a2, n):
    if n == 10:
        return a1
    a3 = a1 + a2
    ret = death(a2, a3, n + 1)
    return ret
f = death(0, 1, 1)
print(f)