归并排序

public class mergeSort {

    //一个拆分函数
    public void sort(int[] a, int left, int right) {
        if (left == right) {
            return;
        }
        int mid = (left + right) / 2;
        sort(a, left, mid);   //左边不断二分
        sort(a, mid + 1, right); //右边不断二分
        merge(a, left, mid, right);   //合并

    }

    //合并函数
    public void merge(int[] a, int left, int mid, int right) {
        int[] temp = new int[right - left + 1]; //创建一个新数组，暂存数据
        int i = left, j = mid + 1, k = 0;
        //把小的数移到新的数组里面
        while (i <= mid && j <= right) {
            if (a[i] < a[j]) {
                temp[k++] = a[i++];
            } else {
                temp[k++] = a[j++];
            }
        }
        //把数组剩下的移到新数组中
        while (i <= mid) {
            temp[k++] = a[i++];
        }
        while (j <= right) {
            temp[k++] = a[j++];
        }
        //用新数组中的值覆盖原先的数组
        for (int x = 0; x < temp.length; x++) {
            a[x + left] = temp[x];
        }
    }

    public static void main(String[] args) {
        int[] a = new int[]{3, 2, 5, 28, 14, 7, 6, 9, 1};
        mergeSort mergeSort = new mergeSort();
        mergeSort.sort(a, 0, a.length - 1);
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + " ");
        }
    }
}