最优时间复杂度:O(n)
最坏时间复杂度:O(n^2)
稳定性:稳定
冒泡排序python代码实现:
def bubble_sort(list):
"""冒泡排序"""
n = len(list)
for i in range(n-1):
count = 0
for j in range(n-1-i):
if list[j] > list[j+1]:
list[j], list[j+1] = list[j+1], list[j]
count += 1
if count == 0:
return
if __name__ == '__main__':
li = [1, 3, 2, 6, 4, 8]
print(li)
bubble_sort(li)
print(li)