def insert_sort(alist):
n = len(alist)
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
if __name__ == "__main__":
li = [78, 23, 5, 4, 90, 16]
print(li)
insert_sort(li)
print(li)
插入排序
最新推荐文章于 2023-09-23 17:47:53 发布