是稳定的排序方法,时间复杂度为O(n^2)
def bubble(list):
length = len(list)-1
for i in range(length):
for j in range(length-i):
if list[j] > list[j+1]:
temp = list[j]
list[j] = list[j+1]
list[j+1] = temp
return list