02归并排序

02归并排序和master公式

归并排序

代码

public class Code01_MergeSort {
//归并排序
    public static void mergeSort(int[] arr){
        if(arr == null || arr.length < 2){
            return;
        }
        process(arr, 0, arr.length - 1);
    }

    public static void  process(int[] arr, int L,int R){
        if (L == R){
            return;
        }
        int mid = L + ((R - L) >> 1); //求中点
        process(arr, L, mid); //左侧
        process(arr, mid + 1, R); //右侧
        merge(arr, L, mid, R);
    }
    public static void merge(int[] arr,int L, int M, int R){
        int[] help = new int[R - L + 1];
        int i = 0;
        int p1 = L;
        int p2 = M +1;
        while (p1 <= M && p2 <= R){ //都不越界
            help[i++] = arr[p1] <= arr[p2] ? arr[p1++] : arr[p2++];
//            if(arr[p1] <= arr[p2]){
//                help[i++] =arr[p1++];
//            }
//            else {
//                help[i++] =arr[p2++];
//            }
        }
        while (p1 <= M){ //左侧越界
            help[i++] = arr[p1++];
        }
        while (p2 <= R){ //右侧越界
            help[i++] = arr[p2++];
        }
        for (i = 0; i < help.length; i++){
            arr[L + i] = help[i];
        }

    }

    public static void  comparator(int[] arr){
        Arrays.sort((arr));
    }
    //test
    public static void main(String[] args) {
        int[] arr ={32,43,23,1,32,4,6,2,45,876,3,5};
        mergeSort(arr);
        for(int i = 0; i <= arr.length - 1; i++){
            System.out.print(arr[i]+" ");
        }

    }
}

结果

Master公式

``

结果

[外链图片转存中…(img-r3VXN3wr-1665373742264)]

Master公式