python 冒泡排序

1 li =[33,2,10,1,10,4,66,777,8,9743,567]
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 print(li)

def bubble_sort(alist):
for j in range(len(alist)-1,0,-1):
# j表示每次遍历需要比较的次数，是逐渐减小的
count = 0
for i in range(j):
if alist[i] > alist[i+1]:
alist[i], alist[i+1] = alist[i+1], alist[i]
count +=1
if count==0:
return

li = [54,26,93,17,77,31,44,55,20]
bubble_sort(li)
print(li)