原理不讲
#非稳定排序算法
def insert_sort(shuzu):
n=len(shuzu)
for i in range(1,n):
j=i
while j>0:#(代表该数字在移到最前面之前)
#可以换成for j in range(i,0,-1),下面再删掉j-=1
if shuzu[j]<shuzu[j-1]:
shuzu[j],shuzu[j - 1]=shuzu[j-1],shuzu[j]
j-=1
else:
break
return shuzu
import time
if __name__=='__main__':
t1=time.time()
a=[1,2,5,79,8,5,634,6,6,3,]
print(insert_sort(a))
t2 = time.time()
print(t2-t1)
测试结果