草稿： Python 冒泡排序法

定义变量：

lst = [1, 9, 8, 11, 6, 3, 4, 10, 5, 2, 7]

实现示例：

length=len(lst)
for i in range(length):
    for j in range(length - 1 - i):
        if lst[j] > lst[j + 1]:
            lst[j], lst[j + 1] = lst[j + 1], lst[j]
print(lst)

排序过程：

[1, 8, 9, 6, 3, 4, 10, 5, 2, 7, 11]
[1, 8, 6, 3, 4, 9, 5, 2, 7, 10, 11]
[1, 6, 3, 4, 8, 5, 2, 7, 9, 10, 11]
[1, 3, 4, 6, 5, 2, 7, 8, 9, 10, 11]
[1, 3, 4, 5, 2, 6, 7, 8, 9, 10, 11]
[1, 3, 4, 2, 5, 6, 7, 8, 9, 10, 11]
[1, 3, 2, 4, 5, 6, 7, 8, 9, 10, 11]
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]