算法_希尔排序_python

#希尔排序            
def shell_sort(array):
    gap = len(array)
    while gap > 1:
        gap = gap // 2
        for i in range(gap, len(array)):
            for j in range(i % gap, i, gap):
                if array[i] < array[j]:
                    array[i], array[j] = array[j], array[i]
                print("for j  ",array)
            print("for i ",array)
        print("while  ",array)
    return array

if __name__ == "__main__":
    ll = [9,3,11,0,4,5,6,8]
    print(insert(ll))