最优时间复杂度:O(n^2)
最坏时间复杂度:O(n^2)
稳定性:不稳定
选择排序python代码实现:
def select_sort(list):
"""选择排序"""
n = len(list)
for i in range(n-1):
min_index = i
for j in range(i+1, n):
if list[min_index] > list[j]:
min_index = j
list[min_index], list[i] = list[i], list[min_index]
if __name__ == '__main__':
li = [1, 9, 8, 2, 3]
print(li)
select_sort(li)
print(li)