#平均复杂度O(n²) 空间复杂度O(1)
def insert_sort(lists):
count = len(lists)
for i in range(1,count):
j = i-1
while j>=0:
if lists[i]<lists[j]:
lists[i],lists[j] =lists[j],lists[i]
j-=1
return lists
lists =[2,1,6,5,9,6,4,3]
for i in insert_sort(lists):
print(i,end =" ")
插入排序
最新推荐文章于 2023-09-23 17:47:53 发布