#冒泡排序 def maopao_sort(data): for i in range(len(data)-1): tmp = 0 for j in range(len(data)-i-1): if data[j] > data[j+1]: data[j], data[j+1] = data[j+1], data[j] tmp = 1 if tmp == 0: break #选择排序 def select_sort(data): for i in range(len(data)-1): for j in range(len(data)-i-1): if data[i] > data[j+i+1]: data[i], data[j+i+1] = data[j+i+1], data[i]
还少一个插入排序。。。
补上
#插入排序 def insert_sort(data): for i in range(1,len(data)):
tmp = data[i] j = i - 1 while j >= 0 and tmp < data[j]: data[i] = data[j] j -= 1 i -= 1
data[i] = tmp