算法(第四版)归并排序 merge方法

   public static void main(String[] args){

        Integer[] papapa = {1,4,7,9,12,16,2,5,8,10,11,17};
        merge(papapa,0,11,5);


        for (Integer value:papapa) {

            StdOut.println(value);
        }

    }

//    public static Comparable[] sort(Comparable[] intList){
//
//
//    }


    public static void merge(Comparable[] intList,int low,int high,int mid){

        Comparable[] tmp = new Comparable[intList.length];
        int i = low;
        int j = mid+1;
        int start = low;
        while(i<=mid || j<=high){
            //处理边界条件 当有一方到达边界
            if(i>mid){
                tmp[start++] = intList[j++];
                continue;
            }else if(j>high){
                tmp[start++] = intList[i++];
                continue;
            }
            if (less(intList[i],intList[j])){
                tmp[start++] = intList[i++];
            }else{
                tmp[start++] = intList[j++];
            }
        }
        //把临时数组的内容覆盖到原数组
        for(int q=low;q<=high;q++){
            intList[q] = tmp[q];
        }

    }