上篇讲到了插入排序,而希尔排序是插入排序的升级,对应插入排序的两个版本,希尔排序也有两种,我们分别的来看一下,然后对比一下其速度的快慢,再与插入排序的速度比一下
import time
def shell_sort1(li):
t1 = time.time()
n = len(li)
gap = n // 2
while gap > 0:
for j in range(gap, n):
while j >= gap and li[j-gap] > li[j]:
li[j-gap], li[j] = li[j], li[j-gap]
j -= gap
gap = gap // 2
t2 = time.time()
print("希尔排序1消耗时间:", t2 - t1)
# print("希尔排序1后:",li)
# 改进版希尔排序
def shell_sort2(li):
t1 = time.time()
n = len(li)
gap = n // 2
while gap > 0:
for i in range(gap, n):
insertVal = li[i]
while i >= gap and li[i - gap] > insertVal:
li[i] = li[i - gap]
i -= gap
li[i] = insertVal
gap = gap // 2
t2 = time.time()
print("改进版希尔排序消耗时间:", t2 - t1)
# print("希尔排序2后:",li)
对比其速度:
from random import shuffle
li = list(range(100000))
shuffle(li)
li1 = li.copy()
shell_sort1(li1)
print()
li2 = li.copy()
shell_sort2(li2)
结果:
希尔排序1消耗时间: 1.5900869369506836
改进版希尔排序消耗时间: 1.2692737579345703
相比普通的插入排序,提高了很多,十万个数据,秒级就出结果了