归并排序

 private static void mergeSort(int[] arr, int start , int end){
        if(start >= end){
            return;
        }
        int mid = (end + start) / 2;
        mergeSort(arr,start,mid);
        mergeSort(arr,mid+1,end);
        merge(arr,start,mid ,end);
    }

    private static void merge(int[] arr, int start, int mid, int end) {
        int[] temp = new int[end - start + 1];
        int leftIndex = start;
        int rightIndex = mid + 1;
        int index = 0;
        while (leftIndex <= mid && rightIndex <= end ){
            if(arr[leftIndex] < arr[rightIndex]){
                temp[index] = arr[leftIndex];
                leftIndex++;
            }else {
                temp[index] = arr[rightIndex];
                rightIndex++;
            }
            index++;
        }
        while (leftIndex <= mid){
            temp[index] = arr[leftIndex];
            leftIndex++;
            index++;
        }
        while (rightIndex <= end){
            temp[index] = arr[rightIndex];
            rightIndex++;
            index++;
        }

        for (int i = 0; i < temp.length; i++) {
            arr[start + i] = temp[i];
        }
    }