-
Notifications
You must be signed in to change notification settings - Fork 1
/
MergeSort.py
43 lines (40 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
MergeSort = []
def Merge(Array):
length = len(Array)
if length >1:
HalfLength = int(length/2)
Array1 = list.copy(Array)
Array2 = list.copy(Array)
for i in range (HalfLength):
Array1.pop(len(Array1)-1)
for i in range (length - HalfLength):
Array2.pop(0)
Array1 = Merge(Array1)
Array2 = Merge(Array2)
return Merge2(Array1, Array2)
else:
return Array
def Merge2(Array1, Array2):
Array3 = []
Var1 = 0
Var2 = 0
while Var1 < len(Array1) and Var2 < len(Array2):
if Array1[Var1] < Array2[Var2]:
Array3.append(Array1[Var1])
Var1 = Var1 + 1
else:
Array3.append(Array2[Var2])
Var2 = Var2 + 1
while len(Array3) != len(Array1) + len(Array2):
if Var1 >= len(Array1):
Array3.append(Array2[Var2])
Var2 = Var2 + 1
elif Var2 >= len(Array2):
Array3.append(Array1[Var1])
Var1 = Var1 + 1
return Array3
Values = int(input("Enter the number of values... : "))
for i in range(Values):
pog = int(input())
MergeSort.append(pog)
print(*Merge(MergeSort),end=" ...Is the sorted list!")