先放代码,有时间再整理思路
def insert_sort(alist):
for i in range(1,len(alist)):
temp=alist[i]
j=i-1
while(j>=0 and temp<alist[j]):
alist[j+1]=alist[j]
j-=1
alist[j+1]=temp
return alist
alist=[8,5,4,9,10,2,1,1,23,8]
print(insert_sort(alist))