-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion19.java
More file actions
41 lines (35 loc) · 1.19 KB
/
question19.java
File metadata and controls
41 lines (35 loc) · 1.19 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
import java.util.Arrays;
public class question19{
public static void main(String[] args){
int[] arr1 = {1, 3, 5, 7};
int[] arr2 = {0, 2, 6, 8, 9};
merge(arr1, arr2);
System.out.println(Arrays.toString(arr1));
System.out.println(Arrays.toString(arr2));
}
static void merge(int[] arr1, int[] arr2) {
int n = arr1.length, m = arr2.length;
int gap = (n + m + 1) / 2;
while (gap > 0) {
int i = 0, j = gap;
while (j < (n + m)) {
int a = get(arr1, arr2, i, n);
int b = get(arr1, arr2, j, n);
if (a > b) {
set(arr1, arr2, i, n, b);
set(arr1, arr2, j, n, a);
}
i++; j++;
}
if (gap == 1) break;
gap = (gap + 1) / 2;
}
}
static int get(int[] arr1, int[] arr2, int index, int n) {
return index < n ? arr1[index] : arr2[index - n];
}
static void set(int[] arr1, int[] arr2, int index, int n, int value) {
if (index < n) arr1[index] = value;
else arr2[index - n] = value;
}
}