归并排序

import java.util.Arrays;

public class Main {
public static void main(String[] args) {
int[] a = {6,5,8,9,4,10,6,0,1,2,3,6,5,4,7,8,9,65};
mergeSort(a, 0, 16);

   System.out.println(Arrays.toString(a));

}
private static void merge(int[] a, int l, int m, int r){
    int[] left = new int[m - l];
    int[] right = new int[r - m + 1];
    int i;
    for(i = l; i < m; i++)
        left[i - l] = a[i];
    for(i = m; i <= r; i++)
        right[i - m] = a[i];
    int j = 0, k = l;
    i = 0;
    while(i < left.length && j < right.length){
        if(left[i] < right[j]){
            a[k++] = left[i++];
        }else {
            a[k++] = right[j++];
        }
    }
    while(i < left.length){
        a[k++] = left[i++];
    }
    while(j < right.length){
        a[k++] = right[j++];
    }
}
private static void mergeSort(int a[], int l, int r){
    if(l == r)return;
    int m = (l + r) / 2;
    mergeSort(a, l, m);
    mergeSort(a, m + 1, r);
    merge(a, l, m + 1, r);
}

}