排序算法系列07-归并排序

dulang2015

于 2020-05-11 13:10:00 发布

阅读量176

点赞数

分类专栏：数据结构与算法文章标签：排序算法数据结构

本文链接：https://blog.csdn.net/wszb2012/article/details/106052061

版权

数据结构与算法专栏收录该内容

16 篇文章 1 订阅

订阅专栏

归并排序简介
实现(java)
复杂度和稳定性

1.归并排序简介
合并排序, 使用分治的思想, 递归用中间索引分解数组, 再合并2个有序数组

2.实现(java)

public class MergeSort {

    public static void main(String[] args) {
        int[] arr = {40, 35, 5, 63, 21, 82, 96, 77, 52, 19};
        System.out.println("原数组: " + Arrays.toString(arr));
        sortArr(arr, 0, arr.length - 1);
        System.out.println("排序后: " + Arrays.toString(arr));
    }

    public static void sortArr(int[] arr, int left, int right) {
        if(left >= right) {
            return;
        }
        int center = (left + right) / 2;
        sortArr(arr, left, center);
        sortArr(arr, center + 1, right);
        merge(arr, left, center, right);
    }

    public static void merge(int[] arr, int left, int center, int right) {
        int[] tmpArr = new int[arr.length];
        int k = left;
        int i = left, j = center + 1;
        while (i <= center && j <= right) {
            if(arr[i] <= arr[j]) {
                tmpArr[k++] = arr[i++];
            }else {
                tmpArr[k++] = arr[j++];
            }
        }
        while (i <= center) {
            tmpArr[k++] = arr[i++];
        }
        while (j <= right) {
            tmpArr[k++] = arr[j++];
        }
        for(int m = left; m <= right; m++) {
            arr[m] = tmpArr[m];
        }
    }
}