python实现希尔排序

'''Created on 2017-1-6@author: admin'''def shellSort(source):    gap=len(source)    while gap//2!=0:        insertSort(source,gap//2)        gap=gap//2def insertSort(source,gap):    for i in range(gap,len(source),gap):        for j in reversed(range(gap,i+gap,gap)):            if source[j]<source[j-gap]:                tmp=source[j-gap]                source[j-gap]=source[j]                source[j]=tmpif __name__ == '__main__':    source=[3,1,9,10,15,6,4,8]    shellSort(source)    for i in range(len(source)):        print(source[i],end=",")