排序算法-归并排序（MergeSort）

算法思想

• 分：把数组分成两半，再递归对子数组进行分操作，直至到一个个单独数字
• 合：把两个数合成有序数组，再对有序数组进行合并操作，直到全部子数组合成一个完整的数组
• • 相当于两个有序数组进行合并为一个数组[left,mid]，[mid+1,right]
  • 先创建一个辅助数组拷贝原数组
  • for循环进行原数组[left,right]的排序,下标递增，取出较小者赋值并出队
  • 如果两个数组还有值，则重复上述第二步
  • 如果只有一个数组有值，则将该数组的值出队并推入到上述新建的数组中

Java实现

public class MergeSort {
    public static void main(String[] args) {
        sort(new int[]{3, 1, 2, 9, 5, 4});
    }

    public static int[] temp;

    public static void sort(int[] nums) {
        temp = new int[nums.length];
        mergeSort(nums, 0, nums.length - 1);
    }

    public static void mergeSort(int[] nums, int left, int right) {
        if (left == right) return;

        int mid = (left + right) / 2;
        mergeSort(nums, left, mid);
        mergeSort(nums, mid + 1, right);

        merge(nums, left, mid, right);
        System.out.println("nums = " + Arrays.toString(nums) + ", left = " + left + ", right = " + right);
    }

    public static void merge(int[] nums, int left, int mid, int right) {
        for (int i = left; i <= right; i++) {
            temp[i] = nums[i];
        }

        int i = left, j = mid + 1;
        for (int p = left; p <= right; p++) {
            if (i == mid + 1) {
                nums[p] = temp[j++];
            } else if (j == right + 1) {
                nums[p] = temp[i++];
            } else if (temp[i] > temp[j]) {
                nums[p] = temp[j++];
            } else {
                nums[p] = temp[i++];
            }
        }
    }
}

nums = [1, 3, 2, 9, 5, 4], left = 0, right = 1
nums = [1, 2, 3, 9, 5, 4], left = 0, right = 2
nums = [1, 2, 3, 5, 9, 4], left = 3, right = 4
nums = [1, 2, 3, 4, 5, 9], left = 3, right = 5
nums = [1, 2, 3, 4, 5, 9], left = 0, right = 5

复杂度

时间复杂度O(nlogn)

空间复杂度O(n)