Function shell_sort

code/all_sort.py:35–44

(relist)

# 希尔
def shell_sort(relist):
    n = len(relist)
    gap = int(n / 2)  # 初始步长
    while gap > 0:
        for i in range(gap, n):
            relist[:i] = insertSort(relist[:i])
            print(relist)
        gap = int(gap / 2)  # 得到新的步长

    return relist


# 插入