用python实现希尔排序(shell_sort)

def shell_sort(a): n = len(a) gap = n >> 1 # gap是长度的一半 while gap > 0: for i in range(gap, n): for j in range(i, 0, -gap): if a[j] < a[j - gap]:

>>阅读原文<<