本文实例讲述了python实现希尔排序算法的方法。分享给大家供大家参考。具体如下：
def shellsort(items):
inc = len(items) / 2
while inc:
for i in xrange(len(items)):
j = i
temp = items[i]
while j >= inc and items[j-inc] > temp:
items[j] = items[j – inc]
j -= inc
items[j] = temp
inc = inc/2 if inc/2 else (0 if inc==1 else 1)
a = [35, -8, 11, 1, 68, 0, 3];
shellsort(a)
print a # [-8, 0, 1, 3, 11, 35, 68]
希望本文所述对大家的python程序设计有所帮助。