排序算法-归并排序

Eistert

已于 2022-07-12 23:09:33 修改

阅读量131

点赞数

分类专栏：算法&LeetCode&NowCoder 文章标签：排序算法算法数据结构

于 2022-07-12 22:44:34 首次发布

本文链接：https://blog.csdn.net/qq_39595769/article/details/125753787

版权

算法&LeetCode&NowCoder 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

代码

package zuochengyun;

/**
 * @Description: 归并排序
 * @Author: eistert
 * @create: 2022-07-12 22:16
 */
public class Code01_MergeSort {


    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++];
        }

        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];
        }
    }
}