归并排序

归并排序

//递归实现
public class MegerSort {
    public static void main(String[] args) {
        int a[] = { 5, 2, 6, 0, 3, 9, 1, 7, 4, 8 };
        System.out.println("排序前的数组");
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + "   ");
        }
        Megersort(a, 0, 9);
        System.out.println();
        System.out.println("排序后的数组");
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + "   ");
        }
    }

    public static void Megersort(int a[], int low, int high) {
        int mid = (low + high) / 2;
        if (low < high) {
            Megersort(a, low, mid);
            Megersort(a, mid + 1, high);
            Meger(a, low, mid, high);
        }


    }

    private static void Meger(int[] a, int low, int mid, int high) {
        int[] temp = new int[high - low + 1];
        int i = low;// 左指针
        int j = mid + 1;// 右指针
        int k = 0;

        while (i <= mid && j <= high) {
            // 把较小的数先移到新数组中
            if (a[i] < a[j]) {
                temp[k++] = a[i++];
            } else {
                temp[k++] = a[j++];
            }
        }

        // 把左边剩余的数移入数组
        while (i <= mid) {
            temp[k++] = a[i++];
        }

        // 把右边边剩余的数移入数组
        while (j <= high) {
            temp[k++] = a[j++];
        }

        // 把新数组中的数覆盖a数组
        for (int t = 0; t < temp.length; t++) {
            a[t + low] = temp[t];
        }
    }
}