java 归并排序

MergingSort 复习笔记

package sort;

import java.util.Arrays;

/**
 * @Classname MergingSort
 * @Description 归并排序, 从小到大
 */
public class MergingSort {
    public static void main(String[] args) {
        int[] list = new int[]{2, 2, 3, 1, 5, 7, 4, 6, 9, 8};
        int[] temp = new int[list.length];

        System.out.println("排序前:"+Arrays.toString(list));

        mergeSort(list, 0, list.length - 1, temp);

        System.out.println("排序后:"+Arrays.toString(list));

    }

    //    归并排序,递归调用,主要体现'分'的思想, merge体现'治','合'的思想
    public static void mergeSort(int[] list, int left, int right, int[] templist) {
        if (left < right) {
            int mid = (left + right) / 2;
            mergeSort(list, left, mid, templist);
            mergeSort(list, mid + 1, right, templist);

            merge(list, left, mid, right, templist);

        }
    }

    public static void merge(int[] list, int left, int mid, int right, int[] temp) {
        int i = left;
        int j = mid + 1;
        int t = 0; //index of temp[]

//        第一种情况,2个子数组内都有值,根据判断,按照排序规则依次向temp[]中填入值
        while (i <= mid && j <= right) {
            if (list[i] < list[j]) {
                temp[t] = list[i];
                t++;
                i++;
            } else {
                temp[t] = list[j];
                t++;
                j++;
            }
        }

//        第二种情况,只有左边的子数组中有值
        while (i <= mid) {
            temp[t] = list[i];
            t++;
            i++;
        }

//        第三种情况,只有右边的子数组中有值
        while (j <= right) {
            temp[t] = list[j];
            t++;
            j++;
        }

//        最后将数组复制
        t = 0;
        int tempLeft = left;
        while (tempLeft <= right){
            list[tempLeft] = temp[t];
            t++;
            tempLeft++;
        }
    }
}