FilesExpand file tree

 master

/

P53_ShellSort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

28 lines (23 loc) · 1.12 KB

 master

/

P53_ShellSort.py

Copy path

Top

File metadata and controls

• Code
• Blame

28 lines (23 loc) · 1.12 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

# Author: OMKAR PATHAK

# This program illustrates the shell sort implementation in Python

# According to Wikipedia "Shell sort or Shell's method, is an in-place comparison sort.

# It can be seen as either a generalization of sorting by exchange (bubble sort) or sorting by

# insertion (insertion sort). The method starts by sorting pairs of elements far apart from each other,

# then progressively reducing the gap between elements to be compared. Starting with far apart elements

# can move some out-of-place elements into position faster than a simple nearest neighbor exchange."

# Best Case O(n logn); Average Case O(depends on gap sequence); Worst Case O(n)

def shellSort(myList):

gap = len(myList) // 2

while gap > 0:

for i in range(gap, len(myList)):

currentItem = myList[i]

j = i

while j >= gap and myList[j - gap] > currentItem:

myList[j] = myList[j - gap]

j -= gap

myList[j] = currentItem

gap //= 2

return myList

if __name__ == '__main__':

myList = [12, 23, 4, 5, 3, 2, 12, 81, 56, 95]

print(shellSort(myList))