时间复杂度O(n^2)
def insert_sort(ls):
for i in range(1,len(ls)): #摸到的下标
tmp=ls[i]
j=i-1 #手里的下标
while ls[j]>tmp and j>=0:
ls[j+1]=ls[j]
j-=1
ls[j+1]=tmp
时间复杂度O(n^2)
def insert_sort(ls):
for i in range(1,len(ls)): #摸到的下标
tmp=ls[i]
j=i-1 #手里的下标
while ls[j]>tmp and j>=0:
ls[j+1]=ls[j]
j-=1
ls[j+1]=tmp