两条升序数组合并成一条数组后仍然升序

int[] arr=new int[]{1,3,5,6,7};
int[] arr2=new int[]{3,4,8,9};
//定义新数组
int[] newArr=new int[arr.length+arr2.length];
int y=0;
int x=0;
for(int i=0;i<newArr.length;i++){
if(y>=arr.length){
newArr[i]=arr2[x++];
}else if(x>=arr2.length){
newArr[i]=arr[y++];
}else if(arr[y]<=arr2[x]){
newArr[i]=arr[y++];
}else{
newArr[i]=arr2[x++];
}
}
for(int v:newArr){
System.out.println(v);
}