-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.java
More file actions
87 lines (62 loc) · 1.63 KB
/
Copy pathMergeSort.java
File metadata and controls
87 lines (62 loc) · 1.63 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
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
78
79
80
81
82
83
84
85
86
87
public class MergeSort {
int[] tempMergeArray;
int[] array;
int length;
public static void main(String[] args) {
int[] inputArr = { 19, 25, 13, 27, 5, 15, 45 };
System.out.print("\nBefore Merge Sorting : ");
for (int i : inputArr) {
System.out.print(i + " ");
}
MergeSort m = new MergeSort();
m.sort(inputArr);
System.out.print("\nAfter Merge Sorting : ");
for (int i : inputArr) {
System.out.print(i + " ");
}
}
public void sort(int[] inputArr) {
this.array = inputArr;
this.length = inputArr.length;
this.tempMergeArray = new int[length];
// call to divideArray()
divideArray(0, length - 1);
}
private void divideArray(int lowerIndex, int higherIndex) {
if (lowerIndex < higherIndex) {
int middle = lowerIndex + (higherIndex - lowerIndex) / 2;
// devide left side array (recursive call)
divideArray(lowerIndex, middle);
// devide rigt side array (recursive call)
divideArray(middle + 1, higherIndex);
mergeArray(lowerIndex, middle, higherIndex);
}
}
public void mergeArray(int lowerIndex, int middle, int higherIndex) {
for (int i = lowerIndex; i <= higherIndex; i++) {
this.tempMergeArray[i] = array[i];
}
int i = lowerIndex;
int j = middle + 1;
int k = lowerIndex;
while (i <= middle && j <= higherIndex) {
if (tempMergeArray[i] <= tempMergeArray[j]) {
array[k] = tempMergeArray[i];
i++;
} else {
array[k] = tempMergeArray[j];
j++;
}
k++;
}
while (i <= middle) {
array[k] = tempMergeArray[i];
k++;
i++;
}
}
}
/* OUTPUT
Before Merge Sorting : 19 25 13 27 5 15 45
After Merge Sorting : 5 13 15 19 25 27 45
*/