FilesExpand file tree

 patch-1

/

insertion_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

48 lines (36 loc) · 1.26 KB

 patch-1

/

insertion_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

48 lines (36 loc) · 1.26 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

"""

This is a pure python implementation of the insertion sort algorithm

For doctests run following command:

python -m doctest -v insertion_sort.py

or

python3 -m doctest -v insertion_sort.py

For manual testing run:

python insertion_sort.py

"""

from __future__ import print_function

def insertion_sort(collection):

"""Pure implementation of the insertion sort algorithm in Python

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: the same collection ordered by ascending

Examples:

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

[0, 2, 2, 3, 5]

>>> insertion_sort([])

[]

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

[-45, -5, -2]

"""

for index in range(1, len(collection)):

while index > 0 and collection[index - 1] > collection[index]:

collection[index], collection[index - 1] = collection[index - 1], collection[index]

index -= 1

return collection

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(insertion_sort(unsorted))