shell sort

shellSort

def shellSort(x):
    h = len(x)//2
    i = h
    while h > 0:
        while i < len(x):
            for j in range(i,0,-1):
                if x[j] < x[j-h]:
                    x[j],x[j-h] = x[j-h],x[j]
                else:
                    break
            i = i+1
        print(x)
        h = h//2
        i=h
    return(x)

y = [i for i in 'sortexample']
shellSort(y)