python-algorithms/ShellSort.py at master · Tanmay-901/python-algorithms

30 lines (22 loc) · 565 Bytes

def shellSort(arr):

n = len(arr)

gap = n/2

while gap > 0:

for i in range(gap,n):

temp = arr[i]

j = i

while j >= gap and arr[j-gap] >temp:

arr[j] = arr[j-gap]

j -= gap

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]),

Provide feedback