希尔排序

1.python

def shellsort(l):                         
    n = len(l)
    h=1
    while h<n/3:
        h=3*h+1
        while h>=1:
            for i in range(h,n):
                j = i
                temp = l[j]
                while j>=h and l[j-h]>temp:
                l[j]=l[j-h]
                j=j-h
                l[j] = temp
                print l
            h=(h-1)/3