FilesExpand file tree

 patch-1

/

comb_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

58 lines (48 loc) · 1.56 KB

 patch-1

/

comb_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

58 lines (48 loc) · 1.56 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

49

50

51

52

53

54

55

56

57

58

"""

Comb sort is a relatively simple sorting algorithm originally designed by Wlodzimierz Dobosiewicz in 1980.

Later it was rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort.

This is pure python implementation of comb sort algorithm

For doctests run following command:

python -m doctest -v comb_sort.py

or

python3 -m doctest -v comb_sort.py

For manual testing run:

python comb_sort.py

"""

def comb_sort(data):

"""Pure implementation of comb sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: the same collection ordered by ascending

Examples:

>>> comb_sort([0, 5, 3, 2, 2])

[0, 2, 2, 3, 5]

>>> comb_sort([])

[]

>>> comb_sort([-2, -5, -45])

[-45, -5, -2]

"""

shrink_factor = 1.3

gap = len(data)

swapped = True

i = 0

while gap > 1 or swapped:

# Update the gap value for a next comb

gap = int(float(gap) / shrink_factor)

swapped = False

i = 0

while gap + i < len(data):

if data[i] > data[i+gap]:

# Swap values

data[i], data[i+gap] = data[i+gap], data[i]

swapped = True

i += 1

return data

if __name__ == '__main__':

try:

raw_input # Python 2

except NameError:

raw_input = input # Python 3

user_input = raw_input('Enter numbers separated by a comma:\n').strip()

unsorted = [int(item) for item in user_input.split(',')]

print(comb_sort(unsorted))