java 递归实现两个有序数组的合并

 public static void main(String[] args) {
        int[] a=new int[]{1,6,9,122};
        int[] b=new int[]{2,3,4};
        int[] temp=new int[7];


       int[]d= compareDG(a,0,b,0,temp,0);
        for (int i=0;i<7;i++){
            System.out.println(d[i]);
        }
    }


    private static int[] compareDG(int[] a,int i, int[] b,int j,int[] c,int k) {
        if (i+j==c.length){
            return c;
        }else if (a.length==i){
            c[k++]=b[j++];
        }else if (b.length==j){
            c[k++]=a[i++];
        }else {
            if (a[i]<b[j]){
                c[k++]=a[i++];
            }else {
                c[k++]=b[j++];
            }
        }
        return compareDG(a,i,b,j,c,k);
    }
}