mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-01 00:41:09 +00:00
57 lines
1.5 KiB
Python
57 lines
1.5 KiB
Python
|
"""
|
||
|
|
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
|
||
|
|
"""
|
||
|
|
from __future__ import print_function
|
||
|
|
|
||
|
|
|
||
|
|
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):
|
||
|
|
least = i
|
||
|
|
for k in range(i + 1, length):
|
||
|
|
if collection[k] < collection[least]:
|
||
|
|
least = k
|
||
|
|
collection[least], collection[i] = (
|
||
|
|
collection[i], collection[least]
|
||
|
|
)
|
||
|
|
return collection
|
||
|
|
|
||
|
|
|
||
|
|
if __name__ == '__main__':
|
||
|
|
import sys
|
||
|
|
# For python 2.x and 3.x compatibility: 3.x has no raw_input builtin
|
||
|
|
# otherwise 2.x's input builtin function is too "smart"
|
||
|
|
if sys.version_info.major < 3:
|
||
|
|
input_function = raw_input
|
||
|
|
else:
|
||
|
|
input_function = input
|
||
|
|
|
||
|
|
user_input = input_function('Enter numbers separated by a comma:\n')
|
||
|
|
unsorted = [int(item) for item in user_input.split(',')]
|
||
|
|
print(selection_sort(unsorted))
|