排序四：归并排序--分治法

/**
 * 归并排序--分治法
 * */

public class Four {

    public static void one(int[] arrA,int[] arrB,int[] arrC) {
        int i=0,j=0,k=0;
        
        while(i<arrA.length && j<arrB.length) {
            if(arrA[i]> arrB[j] ) {
                arrC[k++] = arrB[j++];
            }else {
                arrC[k++] = arrA[i++];
            }
        }
        while(i<arrA.length) {
            arrC[k++] = arrA[i++];
        }
        while(j<arrB.length) {
            arrC[k++] = arrB[j++];
        }
    }
    
}

 

转载于:https://www.cnblogs.com/ZeGod/p/9969548.html