【Java】归并排序

import java.util.Arrays;

public class MergeSort {
    public static void merge(int[] a, int p, int q, int r) {
        int i, j, k, n1, n2;
        n1 = q - p + 1;
        n2 = r - q;
        int[] L = new int[n1];
        int[] R = new int[n2];
        for (i = 0, k = p; i < n1; i++, k++)
            L[i] = a[k];
        for (i = 0, k = q + 1; i < n2; i++, k++)
            R[i] = a[k];
        for (k = p, i = 0, j = 0; i < n1 && j < n2; k++) {
            if (L[i] > R[j]) {
                a[k] = L[i];
                i++;
            } else {
                a[k] = R[j];
                j++;
            }
        }
        if (i < n1) {
            for (j = i; j < n1; j++, k++) {
                a[k] = L[j];
            }
        }
        if (j < n2) {
            for (i = j; i < n2; i++, k++) {
                a[k] = R[i];
            }
        }
    }

    public static void mergeSort(int[] a, int p, int r) {
        if (p < r) {
            int q = (p + r) / 2;
            mergeSort(a, p, q);
            mergeSort(a, q + 1, r);
            merge(a, p, q, r);
        }
    }

    public static void main(String[] args) {
        int[] a = {5, 4, 9, 8, 6, 0, 1, 3, 2};
        int len = a.length;
        mergeSort(a, 0, len - 1);
        System.out.println(Arrays.toString(a));
    }
}