mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
7f04e5cd34
* spelling corrections * review * improved documentation, removed redundant variables, added testing * added type hint * camel case to snake case * spelling fix * review * python --> Python # it is a brand name, not a snake * explicit cast to int * spaces in int list * "!= None" to "is not None" * Update comb_sort.py * various spelling corrections in documentation & several variables naming conventions fix * + char in file name * import dependency - bug fix Co-authored-by: John Law <johnlaw.po@gmail.com>
47 lines
1.2 KiB
Python
47 lines
1.2 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
|
|
"""
|
|
|
|
|
|
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))
|