# 01-冒泡排序
1 li = [33, 2, 10, 1]
2 for j in range(1, len(li)):
3 for i in range(len(li) - j):
4 if li[i] > li[i + 1]:
5 temp = li[i]
6 li[i] = li[i + 1]
7 li[i + 1] = temp
8
9 print(li)
10
11 #打印结果:[1, 2, 10, 33]----------------------------------------------------------------
02-斐波那契额数列
# 写函数,利用递归获取斐波那契数列中的第 10 个数,并将该值返回给调用者
def f(count, a1, a2):
if count == 10:
return a1
a3 = a1 + a2
r = f(count+1, a2, a3)
return r
ret = f(1, 0, 1)
print(ret)
#打印结果:34