class Main { public static int[] mergeSorted(int a[], int b[]){ int i=0; int j=0; int k=0; int resultArr[]= new int[a.length + b.length]; while(i<a.length && j<b.length){ if(a[i] < b[j]){ resultArr[k]=a[i]; i++; k++; } else if(b[j]<a[i]){ resultArr[k]=b[j]; j++; k++; } else { resultArr[k]=a[i]; resultArr[k+1]=b[j]; i++; j++; k=k+2; } } if(i<a.length){ while(k<resultArr.length){ resultArr[k]=a[i]; k++; i++; } } else{ while(k<resultArr.length){ resultArr[k]=b[j]; k++; j++; } } return resultArr; } public static void main(String[] args) { int a[] = {0,3,4,31}; int b[] = {4,6,30}; int result[] = mergeSorted(a , b); for (int i=0;i<result.length;i++){ System.out.println(result[i]); } } }