原理如下:
选择排序中相同元素的前后顺序会发生改变,所以选择排序是一种非稳定型的排序算法。
def choose_sort(lst):
length = len(lst)
for j in range(length):
max_index = 0
for i in range(1, length - j):
if lst[max_index] < lst[i]:
max_index = i
lst[max_index], lst[length - 1 - j] = lst[length - 1 - j], lst[max_index]
return lst
if __name__ == ‘__main__‘:
lst = [3, 4, 5, 7, 1, 2, 6, 9, 0]
print(choose_sort(lst))
# [0, 1, 2, 3, 4, 5, 6, 7, 9]
原文:https://www.cnblogs.com/fengting0913/p/13329338.html