iframe-proxy | Sunbelt Computer Software

History

53 lines (41 loc) · 1.31 KB

Raw

"""

This is a pure python implementation of the selection sort algorithm

For doctests run following command:

python -m doctest -v selection_sort.py

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 - 1):

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__':

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

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

selection_sort.py

Latest commit

History

selection_sort.py

File metadata and controls