冒泡排序python实现

def bubble_sort(alist):
    for j in range(len(alist)-1,0,-1):
        # j表示每次遍历需要比较的次数，是逐渐减小的
        for i in range(j):
            if alist[i] > alist[i+1]:
                alist[i], alist[i+1] = alist[i+1], alist[i]
 
li = [4,26,3,17,7,31,44,55,20]
bubble_sort(li)
print(li)

打印结果：

[3, 4, 7, 17, 20, 26, 31, 44, 55]