快速合并两个有序数组

public class Test{
public static void main(String[] args){
int[] x = new int[]{2,5,7,9,12,15};
int[] y = new int[]{0,1,6,8,23,43};


int[] z = mergeSortedArray(x,y);
for(int t:z){
System.out.print( t + "\t");
}
System.out.println();
}
public static int[] mergeSortedArray(int[] x,int[] y){
int[] newarray = new int[ x.length + y.length];
int xindex = 0;
int yindex = 0;
int newindex = 0;
//循环上面的两个数组
while(xindex<x.length || yindex<y.length){
if(xindex>=x.length && yindex<y.length){
newarray[newindex] = y[yindex];
yindex++;
}else if(yindex>=y.length && xindex<x.length){
newarray[newindex] = x[xindex];
xindex++;
}else if(x[xindex] < y[yindex]){
newarray[newindex] = x[xindex];
xindex++;
}else{
newarray[newindex] = y[yindex];
yindex++;
}
newindex++;
}
return newarray;
}


}