-
Notifications
You must be signed in to change notification settings - Fork 0
/
Mergesort.py
50 lines (39 loc) · 1.03 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
48
49
50
import timeit
start_time = timeit.default_timer()
def merge_sort(arr):
if len(arr) > 1:
mid = len(arr) // 2
L = arr[:mid]
R = arr[mid:]
merge_sort(L)
merge_sort(R)
i = j = k = 0
while i < len(L) and j < len(R):
if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
k += 1
while i < len(L):
arr[k] = L[i]
i += 1
k += 1
while j < len(R):
arr[k] = R[j]
j += 1
k += 1
def print_list(arr):
for i in range(len(arr)):
print(arr[i], end="\n")
print()
if __name__ == "__main__":
arr = [12, 11, 13, 5, 6, 7]
print("Given array is:", end="\n")
print_list(arr)
merge_sort(arr)
print("Sorted array is:", end="\n")
print_list(arr)
time1 = timeit.default_timer() - start_time
print("It took", time1, "seconds")