-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMergeSort.py
77 lines (49 loc) · 2.36 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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#Setting up the parameters
def MergeSort(ArrayToSort):
Array = ArrayToSort.copy()
SortedArray = MergeSortAlg(Array)
return (SortedArray)
# Def Merge Sort
def MergeSortAlg(Array):
if (len(Array) > 1):
#Separate the original array
r = len(Array) // 2 #Find where to split Array
M = Array[r:] #M = From r to where the array finishes
L = Array[:r] #L = From start of the array until r
MergeSortAlg(L)
MergeSortAlg(M)
#Sorting until L or M is left empty
PositionL = 0 # L[i]
PositionM = 0 # M[j]
PositionArray = 0 # Array[PositionArray ]
while (PositionL < len(L)) and (PositionM < len(M)):
if (L[PositionL] < M[PositionM]):
Array[PositionArray] = L[PositionL]
PositionL = PositionL + 1
# if
else:
Array[PositionArray] = M[PositionM]
PositionM = PositionM + 1
#Else
PositionArray = PositionArray + 1
#While
#Add the leftover values to the array
while (PositionL < len(L)):
Array[PositionArray] = L[PositionL]
PositionArray = PositionArray + 1
PositionL = PositionL + 1
# While PositionL < len(L)
while (PositionM < len(M)):
Array[PositionArray] = M[PositionM]
PositionArray = PositionArray + 1
PositionM = PositionM + 1
# While PositionL < len(L)
#if (len(Array) > 1)
return(Array)
#def MergeSortAlg
# Test of the use // Feel free to delete the following lines to use the funtions only
Array = [3, 2, 1, 4, 5, 14, 22, 63, 6, 53, 22, 12, 45, 213, 53, 233, 41, 98]
#Call the MergeSort function and send only the array to sort as parameter
ArrayFinal = MergeSort(Array)
print("Original array: ", Array)
print("Sorted array: ", ArrayFinal)