-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.java
More file actions
54 lines (44 loc) · 1.13 KB
/
MergeSort.java
File metadata and controls
54 lines (44 loc) · 1.13 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
package Recursion;
import java.util.Arrays;
public class MergeSort {
private static void sort(int[] arr, int i, int j) {
if (j-i == 1)
return;
int mid = (i + j) / 2;
sort(arr, i, mid);
sort(arr, mid, j);
merge(arr, i, mid, j);
}
private static void merge(int[] arr, int s, int mid, int e) {
int ans[] = new int[e - s];
int i = s, j = mid, k = 0;
while (i < mid && j < e) {
if (arr[i] < arr[j]) {
ans[k] = arr[i];
i++;
} else {
ans[k] = arr[j];
j++;
}
k++;
}
while (i < mid) {
ans[k] = arr[i];
i++;
k++;
}
while (j < e) {
ans[k] = arr[j];
j++;
k++;
}
for(int q=0;q<ans.length;q++){
arr[s+q] = ans[q];
}
}
public static void main(String[] args) {
int arr[] = { 5, 6, 4, 2, 3, 1, 8 };
sort(arr, 0, arr.length - 1);
System.out.println(Arrays.toString(arr));
}
}