2021-07-09

归并排序是经典的分治策略，分的阶段将问题不断递归分解为小的问题，治的阶段则是将分的阶段的结果不断合并，过程如下所示：

最后可以将temp复制到原数组中再返回或者直接返回temp数组

代码如下：

public class mergeSort {
    public static void main(String[] args) {
        int[] nums = {2,1,5,3,10,4};
        int[] sort = sort(nums, 0, nums.length - 1);
        for (int i : sort) {
            System.out.print(i + " ");
        }
    }

    public static int[] sort(int[] nums,int low,int high){
        if (nums.length == 0) {
            return new int[] {-1};
        }
        if (low == high) {
            return new int[] {nums[low]};
        }
        int mid = (low + high) / 2;
        // 将原始数组不断递归分为左右两部分的数组，直到满足上面low == high 的判断语句
        int[] leftArray = sort(nums,low,mid);
        int[] rightArray = sort(nums,mid + 1,high);
        int[] newArray = new int[leftArray.length + rightArray.length];
        int temp = 0,i = 0,j = 0;
        while (i < leftArray.length && j < rightArray.length) {
            if (leftArray[i] < rightArray[j]){
                newArray[temp++] = leftArray[i++];
            }else {
                newArray[temp++] = rightArray[j++];
            }
        }
        while (i < leftArray.length) {
            newArray[temp++] = leftArray[i++];
        }
        while (j < rightArray.length) {
            newArray[temp++] = rightArray[j++];
        }
        return newArray;
    }
}