//设有两个有序(升序)序列存储在同一数组中相邻的位置上,不妨设为A[l..m],A[m+1..h],将它们归并为一个有序数列,并存储在A[l..h]。
public class BingGui {
public static void main(String args[]) {
int[] A = { 1, 3, 5, 7, 9, 11 };
int[] B = { 2, 4, 6 };
int[] C = new int[A.length + B.length];
int i = 0, j = 0, k = 0;
while (i < A.length && j < B.length && k < C.length) {
if (A[i] >= B[j]) {
C[k] = B[j];
k++;
j++;
}
else {
C[k] = A[i];
k++;
i++;
}
}
System.out.println(i + " " + j + " " + k);
if (i < A.length && j == B.length) {
for (int h = 0; h < A.length - i; h++)
C[k + h] = A[i + h];
}
if (j < B.length && i == A.length) {
for (int h = 0; h < B.length - j; h++)
C[k + h] = B[j + h];
}
for (int h = 0; h < C.length; h++) {
System.out.print(C[h] + " ");
}
}
}