blob: f67171238036b49756f85d36a8bdce5114549c85 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
# 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 insertion_sort(xs):
for i in range(1, len(xs)):
j = i
while j > 0 and xs[j - 1] > xs[j]:
xs[j], xs[j - 1] = xs[j - 1], xs[j]
j -= 1
return xs
if __name__ == '__main__':
import sys
print(insertion_sort(list(map(int, sys.argv[1:]))))
else:
from algorithms.algorithm import SortingAlgorithm
_ALGORITHMS = [
SortingAlgorithm('insertion_sort', 'Insertion sort', insertion_sort),
]
|
