Merge two given sorted integer array A and B into a new sorted integer array.
public int[] mergeSortedArray(int[] A, int[] B) {
int[] result=new int[A.length+B.length];
int indexA=0;
int indexB=0;
int index=0;
while(indexA<A.length && indexB<B.length){
if(A[indexA]<=B[indexB]){
result[index]=A[indexA];
indexA++;
}else{
result[index]=B[indexB];
indexB++;
}
index++;
}
while(indexA<A.length){
result[index]=A[indexA];
indexA++;
index++;
}
while(indexB<B.length){
result[index]=B[indexB];
indexB++;
index++;
}
return result;
}