合并排序

public class MergeSort {
    public static int[] mergeSort(int[] arr) {
        mergeSort(arr, 0, arr.length - 1);
        return arr;
    }

    public static void mergeSort(int[] arr, int p, int r) {
        //数组只剩下一个元素时为已排序数组
        if (r != p) {
            //递归把数组分成两个
            int q = (p + r) / 2;
            mergeSort(arr, p, q);
            mergeSort(arr, q + 1, r);

            //把两个分别已排序数组合并
            merge(arr, p, q, r);
        }
    }

    private static void merge(int[] arr, int p, int q, int r) {
        //数组元素分配到新数组
        int[] lArr = new int[q - p + 1];
        int[] rArr = new int[r - q];

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

        for (int i = 0; i < rArr.length; i++) {
            rArr[i] = arr[q + 1 + i];
        }

        //初始化下标
        int iL = 0;
        int iR = 0;

        //取出较小数合并到arr
        while (iL < lArr.length && iR < rArr.length) {
            if (lArr[iL] < rArr[iR]) {
                arr[p] = lArr[iL];
                iL++;
            } else {
                arr[p] = rArr[iR];
                iR++;
            }
            p++;
        }

        //其中一个数组取完时，直接合并另一个数组
        if (iL == lArr.length) {
            for (; p <= r; p++) {
                arr[p] = rArr[iR];
                iR++;
            }
        } else {
            for (; p <= r; p++) {
                arr[p] = lArr[iL];
                iL++;
            }
        }
    }
}