归并排序Java版

ccxcccx

于 2019-11-14 15:19:14 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

分类专栏： java

本文链接：https://blog.youkuaiyun.com/ccxcccx/article/details/103068012

java 专栏收录该内容

7 篇文章

订阅专栏

本文深入探讨了归并排序算法的实现细节，通过一个具体的Java代码示例，展示了如何将数组分为两部分进行排序，然后合并的过程。文章详细解释了merge和mergeSort两个关键函数的运作原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

public class MergeSort {

    public static void merge(int[] list, int low, int mid, int high) {
        System.out.println(low+","+mid+","+high);
        int i = low;
        int j = mid + 1;
        int[] temp = new int[high - low + 1];
        int k = 0;
        while (i <= mid && j <= high) {
//            System.out.println(i+","+j);
            if (list[i] <= list[j]) {
                temp[k++] = list[i++];
            } else {
                temp[k++] = list[j++];
            }
        }

        while (i <= mid) {
            temp[k++] = list[i++];
        }
        while (j <= high) {
            temp[k++] = list[j++];
        }

        for (i = low, k = 0; i <= high; i++, k++) {
            list[i] = temp[k];
        }
    }

    public static void mergeSort(int[] list, int low, int high) {
        int mid = (high + low) / 2;
        if (low < high) {
            mergeSort(list, low, mid);
            mergeSort(list, mid + 1, high);
            merge(list, low, mid, high);
        }
    }

    public static void main(String[] args) {
        int[] list = { 2, 1, 4, 7, 90, 13, 17, 28, 45, 23, 12, 22};
        mergeSort(list, 0, list.length-1);
        for (int i = 0; i < list.length; i++) {
            System.out.print(list[i] + ",");
        }
    }

}