-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmergeSort.py
More file actions
50 lines (38 loc) · 1.07 KB
/
mergeSort.py
File metadata and controls
50 lines (38 loc) · 1.07 KB
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
comparisons = 0
swaps = 0
def mergeSort(array, left, right):
if left < right:
middle = int((left + right) / 2)
yield from mergeSort(array, left, middle)
yield from mergeSort(array, middle + 1, right)
yield from merge(array, left, middle, right)
def merge(array, left, middle, right):
global comparisons, swaps
left_array = array[left:middle + 1]
right_array = array[middle + 1:right + 1]
i = 0
j = 0
k = left
while i < len(left_array) and j < len(right_array):
yield array, k, middle + j, comparisons, swaps
comparisons = 0
swaps = 0
comparisons += 1
swaps += 1
if left_array[i] < right_array[j]:
array[k] = left_array[i]
i += 1
else:
array[k] = right_array[j]
j += 1
k += 1
while i < len(left_array):
swaps += 1
array[k] = left_array[i]
i += 1
k += 1
while j < len(right_array):
swaps += 1
array[k] = right_array[j]
j += 1
k += 1