冒泡排序 Python

最新推荐文章于 2025-12-03 12:28:21 发布

转载最新推荐文章于 2025-12-03 12:28:21 发布 · 132 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://www.cnblogs.com/Mufasa/p/10527387.html

文章标签：

#python #排序算法

d0 = [2, 15, 5, 9, 7, 6, 4, 12, 5, 4, 2, 64, 5, 6, 4, 2, 3, 54, 45, 4, 44]
d0_out = [2, 2, 2, 3, 4, 4, 4, 4, 5, 5, 5, 6, 6, 7, 9, 12, 15, 44, 45, 54, 64]  # 正确排序
while 1:
    flag = 0
    for i in range(len(d0)-1):
        if d0[i] > d0[i+1]:
            # d0[i], d0[i+1] = d0[i+1], d0[i]
            d0[i + 1], d0[i] = d0[i], d0[i + 1]
            flag = 1
    if flag == 0:
        break
print(d0)