Java排序算法：归并排序

归并排序（Merge Sort）

动图演示地址（https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html）

代码结构

源码

前置条件：父接口和测试类从上篇文章获取（https://blog.csdn.net/jt781861965/article/details/117051443）

package suanfa.paixu;


public class GuiBingTest implements Sort {

    public static void main(String[] args) {
        Test.test(new GuiBingTest());
    }

    // 递归方法实现
    public void sort(int[] arr) {
        if (arr == null || arr.length < 2) {
            return;
        }
        process(arr, 0, arr.length - 1);
    }

    public void process(int[] arr, int l, int r) {
        if (l == r) {
            return;
        }
        int m = l + ((r - l) >> 1);
        process(arr, l, m);
        process(arr, m + 1, r);
        merge(arr, l, m, r);
    }

    public void merge(int[] arr, int l, int m, int r) {
        int[] help = new int[r - l + 1];
        int p1 = l;
        int p2 = m + 1;
        int index = 0;
        while (p1 <= m && p2 <= r) {
            help[index++] = arr[p1] <= arr[p2] ? arr[p1++] : arr[p2++];
        }
        while (p1 <= m) {
            help[index++] = arr[p1++];
        }
        while (p2 <= r) {
            help[index++] = arr[p2++];
        }
        for (int i = 0; i < index; i++) {
            arr[l + i] = help[i];
        }
    }
}