public static void MergeSort(int[] arr,int l , int r) {
        if (l == r || r < 0){
            return;
        }
        int middle = l+(r-l)/2; //取中值，可以防止達(dá)到Integer.MaxValue 溢出
        MergeSort(arr,l,middle);
        MergeSort(arr,middle+1,r);
        sort(arr,l,middle,r);
    }
    /**
     *
     * @param arr 等待排序的數(shù)組
     * @param l 左數(shù)組第一個(gè)指針
     * @param middle 分割左右數(shù)組
     * @param r 右數(shù)組最后一個(gè)指針
     */
    private static void sort(int[] arr, int l, int middle, int r) {
        int[] temp = new int[arr.length];
        System.arraycopy(arr, 0, temp, 0, arr.length);
        int right_first = middle+1;
        int tempIndex = l;
        while (l <= middle && right_first <= r){
            if (temp[tempIndex] < temp[right_first]){
                arr[l++] = temp[tempIndex++];
            }else {
                arr[l++] = temp[right_first++];
            }
        }
        while (tempIndex <= middle){
            arr[l++] = temp[tempIndex++];
        }
        while (right_first <= r ){
            arr[l++] = temp[right_first++];
        }

    }

   //生成1-100內(nèi)隨機(jī)數(shù)組
   public static int[] getParamArrays(){
        int[] result = new int[(int) (Math.random() * 100)];
        //隨機(jī)生成數(shù)
        for (int i = 0; i < result.length; i++) {
            result[i] = (int) (Math.random() * 100);
        }
        return result;
    }
    public static void main(String[] args){
        for (int i = 0; i < 1000000; i++) {
            int[] nums = getParamArrays();
            int[] temp = nums;
            MergeSort(nums,0,nums.length-1);
            Arrays.sort(temp);
            //通過自定義比較次數(shù)，對(duì)隨機(jī)數(shù)組進(jìn)行排序驗(yàn)證正確性
            if (!nums.equals(temp)){
                System.out.println("wrong");
            }
        }
        System.out.println("end");
    }