python 排序算法 -- 冒泡排序

# 冒泡排序的算法编码 --升序排列     

lst = [10, 11, 14, 16, 18, 13, 3, 19, 12, 20]
# lst = [3, 10, 11, 12, 13, 14, 16, 18, 19, 20]

copy_lst = lst.copy()

length = len(copy_lst)

for i in range(length):
    Flag = False
    for j in range(length-i-1):
        if copy_lst[j] > copy_lst[j+1]:
            copy_lst[j], copy_lst[j+1] = copy_lst[j+1], copy_lst[j]
            Flag = True

    if not Flag:
        print('sort success!')
        break


print(copy_lst)