def shell_sort(alist):
n = len(alist)
gap = n//2
while gap >0:
for j in range(gap, n):
i=j
while i >0:
if alist[i]<alist[i-gap]:
aist[i], alist[i-gap] = alist[i-gap], alist[i]
i -=1
else:
break
gap //=2
菜鸟笔记--希尔排序
最新推荐文章于 2024-09-14 20:03:08 发布