python3 冒泡排序

# 冒泡排序 每一轮将当前最大的拍到最后 远数据检索范围缩小1source = [12, 4, 67, 2, 34, 11, 89, 45, 76, 29]num = len(source)k = 1while 1:    for i in range(num-k):        if source[i] > source[i+1]:            temp = source[i]            source[i] = source[i+1]            source[i+1] = temp    k += 1    print(source)    if k == num - 1:        break
print(source)
每一步的执行结果
[4, 12, 2, 34, 11, 67, 45, 76, 29, 89][4, 2, 12, 11, 34, 45, 67, 29, 76, 89][2, 4, 11, 12, 34, 45, 29, 67, 76, 89][2, 4, 11, 12, 34, 29, 45, 67, 76, 89][2, 4, 11, 12, 29, 34, 45, 67, 76, 89][2, 4, 11, 12, 29, 34, 45, 67, 76, 89][2, 4, 11, 12, 29, 34, 45, 67, 76, 89][2, 4, 11, 12, 29, 34, 45, 67, 76, 89]
最终结果[2, 4, 11, 12, 29, 34, 45, 67, 76, 89]