算法（一）冒泡排序

def bubble_sort(alist):
    """冒泡排序"""
    n = len(alist)
    for j in range(n - 1):
        for i in range(n - j - 1):
            if alist[i] > alist[i + 1]:
                alist[i], alist[i+1] = alist[i+1], alist[i]
    return alist

if __name__ == '__main__':
    a = bubble_sort([1,2,6,7,3,9,3])
    print(a)