归并排序模板

最新推荐文章于 2025-02-22 17:00:15 发布

wchysx

最新推荐文章于 2025-02-22 17:00:15 发布

阅读量91

点赞数

本文链接：https://blog.youkuaiyun.com/wchysx/article/details/107072840

版权

    void merge(int[] arr, int start, int end) {
        if (start == end) return;
        int mid = (start + end) / 2;
        merge(arr, start, mid);
        merge(arr, mid + 1, end);

        int[] temp = new int[end - start + 1];
        int i = start, j = mid + 1, k = 0;
        while(i <= mid && j <= end)
            temp[k++] = arr[i] < arr[j] ? arr[i++] : arr[j++];
        while(i <= mid)
            temp[k++] = arr[i++];
        while(j <= end)
            temp[k++] = arr[j++];
        System.arraycopy(temp, 0, arr, start, end);
    }