用于 ShellSort 的Python程序
在 shellSort 中,我们为较大的 h 值对数组进行 h 排序。我们不断减少 h 的值,直到它变为 1。如果每个第 h 个元素的所有子列表都已排序,则称数组是 h 排序的。
# Python program for implementation of Shell Sort
def shellSort(arr):
# Start with a big gap, then reduce the gap
n = len(arr)
gap = n/2
# Do a gapped insertion sort for this gap size.
# The first gap elements a[0..gap-1] are already in gapped
# order keep adding one more element until the entire array
# is gap sorted
while gap > 0:
for i in range(gap,n):
# add a[i] to the elements that have been gap sorted
# save a[i] in temp and make a hole at position i
temp = arr[i]
# shift earlier gap-sorted elements up until the correct
# location for a[i] is found
j = i
while j >= gap and arr[j-gap] >temp:
arr[j] = arr[j-gap]
j -= gap
# put temp (the original a[i]) in its correct location
arr[j] = temp
gap /= 2
# Driver code to test above
arr = [ 12, 34, 54, 2, 3]
n = len(arr)
print ("Array before sorting:")
for i in range(n):
print(arr[i]),
shellSort(arr)
print ("\nArray after sorting:")
for i in range(n):
print(arr[i]),
# This code is contributed by Mohit Kumra
输出:
Array before sorting:
12 34 54 2 3
Array after sorting:
2 3 12 34 54
有关详细信息,请参阅有关 ShellSort 的完整文章!