-
Notifications
You must be signed in to change notification settings - Fork 5
/
MergeSort.py
55 lines (41 loc) · 1.12 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
51
52
53
54
55
# Problem Description: https://practice.geeksforgeeks.org/problems/merge-sort/1
def sortedMerge(a, b):
apoint = bpoint = 0
res = []
while(apoint < len(a) and bpoint < len(b)):
if(a[apoint] <= b[bpoint]):
res.append(a[apoint])
apoint += 1
else:
res.append(b[bpoint])
bpoint += 1
while(apoint < len(a)):
res.append(a[apoint])
apoint += 1
while(bpoint < len(b)):
res.append(b[bpoint])
bpoint += 1
return res
def mergeSortUtil(arr):
n = len(arr)
if(n < 0):
return -1
if(n == 1):
return arr
firsthalf = mergeSortUtil(arr[:n // 2])
secondhalf = mergeSortUtil(arr[n // 2:])
res = sortedMerge(firsthalf, secondhalf)
return res
def mergeSort(arr):
res = mergeSortUtil(arr)
for i in range(len(arr)):
arr[i] = res[i]
if __name__ == "__main__":
t = int(input())
for i in range(t):
n = int(input())
arr = list(map(int, input().split()))
mergeSort(arr)
for i in range(n):
print(arr[i], end=" ")
print()