冒泡排序是一种稳定的排序方法,最好O(n),最坏、平均O(n2),空间复杂度O(1)
def bubble_sort(lists):
lens = len(lists)
for i in range(lens-1):
for j in range(lens-1-i):
if lists[j]>lists[j+1]:
lists[j], lists[j+1] = lists[j+1], lists[j]
return lists
if __name__ == '__main__':
lists = [3, 4, 2, 8, 9, 5, 1]
print('排序前序列为:',end='')
for i in lists:
print(i,end=' ')
print('\n排序后结果为:',end='')
for i in bubble_sort(lists):
print(i,end=' ')