forked from JimChengLin/JimCollection
-
Notifications
You must be signed in to change notification settings - Fork 0
/
MergeSort.py
47 lines (33 loc) · 1.2 KB
/
MergeSort.py
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
from numbers import Number
from typing import List
sample = [1, 4, 6, 9, 0, 2, 6, 9, 1, 2, 6]
def divide(root: List[Number]) -> List[Number]:
if len(root) > 1:
mid = len(root) // 2
return merge(divide(root[:mid]), divide(root[mid:]))
else:
return root
def merge(left: List[Number], right: List[Number]) -> List[Number]:
result = []
def make_generator(gen_obj):
for i in (*gen_obj, StopIteration):
yield i
left_generator = make_generator(left)
right_generator = make_generator(right)
left_value = next(left_generator)
right_value = next(right_generator)
while True:
if left_value < right_value:
result.append(left_value)
left_value = next(left_generator)
else:
result.append(right_value)
right_value = next(right_generator)
if left_value == StopIteration:
result.extend([right_value, *(i for i in right_generator if i != StopIteration)])
break
elif right_value == StopIteration:
result.extend([left_value, *(i for i in left_generator if i != StopIteration)])
break
return result
print(divide(sample))