blob: cf83bd5cbcae5edebe565789c5d9a00f5b44dfd7 (
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
40
41
42
43
44
45
46
47
48
49
50
51
52
|
# Copyright (c) 2015 Egor Tensin <egor@tensin.name>
# 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 merge(left, right):
result = []
l, r = 0, 0
while l < len(left) and r < len(right):
if left[l] <= right[r]:
result.append(left[l])
l += 1
else:
result.append(right[r])
r += 1
if left:
result.extend(left[l:])
if right:
result.extend(right[r:])
return result
def merge_sort(xs):
if len(xs) < 2:
return xs
mid = len(xs) // 2
return merge(merge_sort(xs[:mid]), merge_sort(xs[mid:]))
_ALGORITHMS = [
SortingAlgorithm("merge_sort", "Merge sort", merge_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(merge_sort(list(xs)))
if __name__ == "__main__":
main()
|
