li = [33,22,10,1]
#外部循实现整体排序
for j in range(1,len(li)-1):
#内部循环实现第一次排序[22,10,1,33]
for i in range(len(li)-j):
if li[i]>li[i+1]:
li[i],li[i+1]=li[i+1],li[i]
递归:
#1-100求和
def f(i):
if i==1:
return 1
sum = i+f(i-1)
return sum
#函数
def c(deep,a1,a2):
print(deep)
if deep==10:
return a1
a3=a1+a2
r=c(deep+1,a2,a3)
return r