def bubble_sort(li): for i in range(len(li)-1): for j in range(len(li)-i-1): if li[j] li[j 1]: li[j], li[j 1] li[j 1], li[j] print(li)
例子1
li [3,4,2,9,5,7,0] bubble_sort(li)
结果
[3, 2, 4, 5, 7, 0, 9]
[2, 3, 4, 5, 0, 7, 9]
[2, 3, 4, 0, 5, 7, 9]
[2, 3, 0, 4, 5, 7, 9]
[2, 0, 3, 4, 5, 7, 9]
[0, 2, 3, 4, 5, 7, 9]
算法复杂度O(n2 )
例子2
li [3,4,2,9,5,7,0,11,12,13,14,15,16] bubble_sort(li)
结果
[3, 2, 4, 5, 7, 0, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 4, 5, 0, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 4, 0, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 0, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 0, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
如果冒泡排序中的一趟排序没有发生交换 则说明列表已经有序 可以结束算法。
def bubble_sort(li): for i in range(len(li)-1): exchange False for j in range(len(li)-i-1): if li[j] li[j 1]: li[j], li[j 1] li[j 1], li[j] exchange True print(li) if not exchange: break li [3,4,2,9,5,7,0,11,12,13,14,15,16] bubble_sort(li)
结果
[3, 2, 4, 5, 7, 0, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 4, 5, 0, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 4, 0, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 3, 0, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[2, 0, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
[0, 2, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16]
