blob: e9a5a09cbd102ab8e4afd1fbc78e8532f0c03a09 (
plain) (
blame)
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
|
# Copyright (c) 2015 Egor Tensin <Egor.Tensin@gmail.com>
# This file is part of the "Sorting algorithms" project.
# For details, see https://github.com/egor-tensin/sorting-algorithms.
# Distributed under the MIT License.
import sys
from ..algorithm import SortingAlgorithm
def selection_sort(xs):
for i in range(len(xs) - 1):
min_i = i
for j in range(i + 1, len(xs)):
if xs[j] < xs[min_i]:
min_i = j
if min_i != i:
xs[i], xs[min_i] = xs[min_i], xs[i]
return xs
_ALGORITHMS = [
SortingAlgorithm('selection_sort', 'Selection sort', selection_sort),
]
def _parse_args(args=None):
if args is None:
args = sys.argv[1:]
return list(map(int, args))
def main(args=None):
xs = _parse_args(args)
print(selection_sort(list(xs)))
if __name__ == '__main__':
main()
|
