归并排序-数组

二路归并代码

//二路归并
class Solution{
public:
    //归并排序（递归）
    void mergeSort(vector<int> nums, int left, int right){
        if(left>=right){
            return;
        }
        int mid = left + ((right-left)>>1);
        mergeSort(nums,left,mid);//递归左边排序
        mergeSort(nums,mid+1,right);//递归右边排序
        merge(nums,left,mid,right);//合并左右两个排序数组
    }
    //合并两个有序数组
    void merge(vector<int> nums, int left, int mid, int right){
        vector<int> tmp(right-left+1,0);
        int i = left;
        int j = mid + 1;
        int k = 0;
        //合并两个有序数组[left,mid]，[mid+1,right]
        while(i<=mid && j<=right){
            if(nums[i]<nums[j]){//左边小
                tmp[k++] = nums[i++];
            }
            else {//右边小
                tmp[k++] = nums[j++];
            }
        }
        //处理尾部
        if(i<=mid){//左边有剩余
            while(i<=mid)
                tmp[k++] = nums[i++];
        }
        else {//右边有剩余
            while(j<=right)
                tmp[k++] = nums[j++];
        }
        //将排好序的数组放回原数组中
        while(k>=0){
            nums[right--] = nums[--k];
        }
    }
};