FilesExpand file tree

 Write-for-current-Python

/

selection_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (35 loc) · 1.17 KB

 Write-for-current-Python

/

selection_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (35 loc) · 1.17 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

"""

This is a pure Python implementation of the selection sort algorithm

For doctests run following command:

python -m doctest -v selection_sort.py

or

python3 -m doctest -v selection_sort.py

For manual testing run:

python selection_sort.py

"""

def selection_sort(collection):

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

:param collection: some mutable ordered collection with heterogeneous

comparable items inside

:return: the same collection ordered by ascending

Examples:

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

[0, 2, 2, 3, 5]

>>> selection_sort([])

[]

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

[-45, -5, -2]

"""

length = len(collection)

for i in range(length - 1):

least = i

for k in range(i + 1, length):

if collection[k] < collection[least]:

least = k

if least != i:

collection[least], collection[i] = (collection[i], collection[least])

return collection

if __name__ == "__main__":

user_input = input("Enter numbers separated by a comma:\n").strip()

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

print(selection_sort(unsorted))