随手写了个排序算法，直觉上就是冒泡排序。果然冒泡是大学第一个掌握的排序算法

def bubbleSort():

    for i in range(len(a)):
        for j in range(i+1,len(a)):
            if a[j]<a[i]:
                temp = a[j]
                a[j] = a[i]
                a[i] = temp
                
        print(a)

[1, 4, 6, 3, 2, 6, 8, 4]
[1, 2, 6, 4, 3, 6, 8, 4]
[1, 2, 3, 6, 4, 6, 8, 4]
[1, 2, 3, 4, 6, 6, 8, 4]
[1, 2, 3, 4, 4, 6, 8, 6]
[1, 2, 3, 4, 4, 6, 8, 6]
[1, 2, 3, 4, 4, 6, 6, 8]
[1, 2, 3, 4, 4, 6, 6, 8]