-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSemi3.java
More file actions
50 lines (47 loc) · 1.35 KB
/
Semi3.java
File metadata and controls
50 lines (47 loc) · 1.35 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
import java.util.Arrays;
public class Semi3 {
public static void main(String[] args) {
int[] inputArray = new int[]{6, 5, 1, 8,31,3,24,12,123,11,22,30};
mergeSort(inputArray);
System.out.println(Arrays.toString(inputArray));
}
static void mergeSort(int[] input) {
if (input.length < 2){
return;
}
int len = input.length;
int[] lefttAr = new int[len/2];
System.arraycopy(input,0,lefttAr,0,len/2);
int[] rightAr = new int[len-len/2];
System.arraycopy(input,len/2 , rightAr,0, len - (len/2));
mergeSort(lefttAr);
mergeSort(rightAr);
merge(input,rightAr,lefttAr);
}
static void merge(int[] res, int[] rightAr, int[] lefttAr) {
int l = 0;
int r = 0;
int resUk = 0;
while (r<rightAr.length & l<lefttAr.length){
if(rightAr[r] <= lefttAr[l]){
res[resUk] = rightAr[r];
r++;
resUk++;
} else {
res[resUk] = lefttAr[l];
resUk++;
l++;
}
}
while (r<rightAr.length){
res[resUk] = rightAr[r];
r++;
resUk++;
}
while (l<lefttAr.length) {
res[resUk] = lefttAr[l];
resUk++;
l++;
}
}
}