mirror of
https://github.com/heqin-zhu/algorithm.git
synced 2024-03-22 13:30:46 +08:00
13 lines
329 B
Python
13 lines
329 B
Python
def shellSort(s,inc=None):
|
|
if inc is None:inc = [1,3,5,7,11,13,17,19]
|
|
num = len(s)
|
|
inc.sort(reverse=True)
|
|
for i in inc:
|
|
for j in range(i,num):
|
|
cur = j
|
|
while cur>=i and s[j] > s[cur-i]:
|
|
s[cur] = s[cur-i]
|
|
cur-=i
|
|
s[cur] = s[j]
|
|
return s
|