Not Getting Sorted Array

package merge;

public class merging2array {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[] arr1= {9,6,4,9,7,3};
	int[] arr2= {78,6,4,67,54,90,3,2,9,6};
	int[] merged = merge2array(arr1,arr2);
	display(merged);

}public static int[] merge2array(int[] arr1,int[] arr2) {
	int[] merged= new int [arr1.length + arr2.length];
			int i = 0;
	int j = 0;
	int k = 0;
	while(i<arr1.length && j <arr2.length) {
		if(arr1[i]<=arr2[j]) {
			merged[k++]=arr1[i++];
		
		}else {
			merged[k++]=arr2[j++];
			
		}
	}
	if(i==arr1.length) {
		while(j<arr2.length) {
			merged[k++]=arr2[j++];
		
		}
	}if(j==arr2.length) {
		while(i<arr1.length) {
			merged[k++]=arr1[i++];
		//	i++;
		//	k++;
		}
	}return merged;
}public static void display(int[] arr) {
	for(int i =0 ; i<arr.length;i++) {
		System.out.println(arr[i]);
	}
}

}

You needn’t return arrays from merge and mergesort arrays. Use the original array to divide it into 2 parts. But don’t return anything from merge and mergesort.
see this
https://ide.codingblocks.com/s/387372