FilesExpand file tree

 master

/

Shell Sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (34 loc) · 1.16 KB

 master

/

Shell Sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (34 loc) · 1.16 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

# 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 mohd-mehraj