归并排序

package heapSort;

public class MergeSort {
    public static void main(String[] args) {
        int[]array={11,10,22,21,45,32,99,88,77,66,101,33};
        mergeSort(array,0,array.length-1);
        for(int i=0;i<array.length;i++){
            System.out.print(array[i]+" ");
        }
    }
    private static void mergeSort(int[] array,int left,int right){
        int mid = (left + right) / 2;
        if (left < right) {
            // 左边
            mergeSort(array, left, mid);
            // 右边
            mergeSort(array, mid + 1, right);
            // 左右归并
            merge(array, left, mid, right);
        }
    }
    private static void merge(int[] array,int left,int mid,int right){
        int lIndex=left;
        int rindex=mid+1;
        int index=0;
        int[] result=new int[right-left+1];
        while(lIndex<=mid&&rindex<=right){
            if(array[lIndex]<array[rindex]){
                result[index++]=array[lIndex++];
            }else{
                result[index++]=array[rindex++];
            }
        }
        while(lIndex<=mid){
            result[index++]=array[lIndex++];
        }
        while(rindex<=right){
            result[index++]=array[rindex++];
        }
        for(int i=0;i<result.length;i++){
            array[left+i]=result[i];
        }
    }
}