冒泡排序

def bubble_sort(alist):
    n = len(alist)
    for j in range(0,n-1):
        count = 0
        for i in range(0,n-1-j):
            if alist[i] > alist[i+1]:
                alist[i],alist[i+1] = alist[i+1],alist[i]
                count += 1
        if count == 0:
            return


if __name__ == '__main__':
    li = [9,8,7,6,5,4,3,2,1]
    # li = [1,2,3,4,5,6,7,8,9]
    print(li)
    bubble_sort(li)
    # select_sort(li)
    # insert_sort(li)
    # shell_sort(li)
    print(li)