blob: 1abbf84c48a1eb27c0a4af41713ec1ef1a0e5f7e (
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
|
# 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 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
_ALGORITHMS = [
SortingAlgorithm('insertion_sort', 'Insertion sort', insertion_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(insertion_sort(list(xs)))
if __name__ == '__main__':
main()
|
