选择排序原理不在这里详细讲
#非稳定排序算法
def select_sort(shuzu):
n=len(shuzu)
for i in range(n-1):
min=i
for j in range(i+1,n):
if shuzu[j]<shuzu[min]:
min=j
shuzu[min],shuzu[i]=shuzu[i],shuzu[min]
return shuzu
import time
if __name__=='__main__':
t1 = time.time()
a = [1, 2, 5, 79, 8, 5, 634, 6, 6, 3, ]
print(select_sort(a))
t2 = time.time()
print(t2-t1)
测试结果