def insert_sort(alist):
len(alist)=n
for j in range(1,n):
i=j
while i>0:
if alist[i]<alist[i-1]:
alist[i], alist[i-1] = alist[i-1], alist[i]
i -=1
else:
break
菜鸟笔记--插入排序
最新推荐文章于 2023-04-06 21:29:05 发布
def insert_sort(alist):
len(alist)=n
for j in range(1,n):
i=j
while i>0:
if alist[i]<alist[i-1]:
alist[i], alist[i-1] = alist[i-1], alist[i]
i -=1
else:
break