def gogoggo(a):
if a==1:
return 1
if a==2:
return 1
else:
return gogoggo(a-1)+gogoggo(a-2)
print(gogoggo(10))
import numpy as np
alist=np.random.randint(100,size=6)
count=len(alist)
for i in range(count-1):
for j in range(count-i-1):
if alist[j]>alist[j+1]:
alist[j],alist[j+1]=alist[j+1],alist[j]
print(alist)
冒泡排序:先随机生成一列表,记住count-i-1是每次到头已经有有一个排好了
第一天坚持下去