日撸java_day49

最新推荐文章于 2024-09-25 10:59:43 发布

luv_x_c

最新推荐文章于 2024-09-25 10:59:43 发布

阅读量48

点赞数

文章标签： java 开发语言

本文链接：https://blog.csdn.net/weixin_58320200/article/details/131091406

版权

该代码示例展示了如何使用递归实现归并排序。通过`mergeSortRecursive`方法进行递归分割，然后用`merge`方法合并已排序的子数组，最终对一个无序的DataArray（包含键值和内容）进行排序。

摘要由CSDN通过智能技术生成

第 49 天: 归并排序

    /**
     * Merge sort recursive.
     *
     * @param paraStart The start index.
     * @param paraEnd   The end index.
     */
    private void mergeSortRecursive(int paraStart, int paraEnd) {
        if (paraStart < paraEnd) {
            mergeSortRecursive(paraStart, (paraStart + paraEnd) / 2);
            mergeSortRecursive((paraStart + paraEnd) / 2 + 1, paraEnd);
            merge(paraStart, (paraStart + paraEnd) / 2, paraEnd);
            System.out.println(this);
        }// Of if
    }// Of mergeSortRecursive

    private void merge(int paraLeft, int paraRight, int paraRightEnd) {
        DataNode[] tempDataArray = new DataNode[paraRightEnd - paraLeft + 1];
        int tempDataArrayIndex = 0, tempLeftIndex = paraLeft, tempRightIndex = paraRight + 1;

        // Compare and copy.
        while (tempLeftIndex <= paraRight && tempRightIndex <= paraRightEnd) {
            if (data[tempLeftIndex].key < data[tempRightIndex].key) {
                tempDataArray[tempDataArrayIndex++] = data[tempLeftIndex++];
            } else {
                tempDataArray[tempDataArrayIndex++] = data[tempRightIndex++];
            }// Of if
        }// Of while

        // Copy to rest data.
        while (tempLeftIndex <= paraRight) {
            tempDataArray[tempDataArrayIndex++] = data[tempLeftIndex++];
        }// Of while
        while (tempRightIndex <= paraRightEnd) {
            tempDataArray[tempDataArrayIndex++] = data[tempRightIndex++];
        }// Of while

        System.arraycopy(tempDataArray, 0, data, paraLeft, tempDataArray.length);
    }// Of merge

    /**
     * Merge sort.
     */
    public void mergeSort() {
        mergeSortRecursive(0, length - 1);
    }// Of mergeSort

    /**
     * Test unit.
     */
    public static void mergeSortTest() {
        int[] tempUnsortedKeys = {5, 3, 6, 10, 7, 1, 9};
        String[] tempContents = {"if", "then", "else", "switch", "case", "for", "while"};
        DataArray tempDataArray = new DataArray(tempUnsortedKeys, tempContents);

        System.out.println(tempDataArray);

        tempDataArray.mergeSort();
        System.out.println(tempDataArray);
    }// Of mergeSortTest