blob: 27b319f48e8f79f7667b796bfd1d9704a13aaae5 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
# Copyright 2015 Egor Tensin <Egor.Tensin@gmail.com>
# This file is licensed under the terms of the MIT License.
# See LICENSE.txt for details.
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
if __name__ == '__main__':
import sys
print(selection_sort(list(map(int, sys.argv[1:]))))
else:
from algorithms.algorithm import SortingAlgorithm
_ALGORITHMS = [
SortingAlgorithm('selection_sort', 'Selection sort', selection_sort),
]
|
