002-1算法笔记【分治】归并排序

#include<iostream>
#include<vector>
using namespace std;

void MergeSort_recur_helper(vector<int>& a,int low,int high);
void MergeSort_recur(vector<int>& a){
    if(a.size()==0)return;
    MergeSort_recur_helper(a,0,a.size()-1);
}
void MergeSort_recur_helper(vector<int>& a,int low,int high){
    if(low>=high)return;
    int mid=(low+high)/2;
    MergeSort_recur_helper(a,low,mid);
    MergeSort_recur_helper(a,mid+1,high);

    //将两个有序数组a[low,mid],a[mid+1,high]，合并成一个
    vector<int> tmp(a.size());

    int i=low,j=mid+1;
    int pos=0;//tmp[]中的当前位置
    while(i<=mid && j<=high){
        if(a[i]<=a[j])
            tmp[pos++]=a[i++];
        else
            tmp[pos++]=a[j++];
    }
    while(i<=mid)
        tmp[pos++]=a[i++];
    while(j<=high)
        tmp[pos++]=a[j++];

    //排好序的数组放回a[]
    for(int i=0;i<pos;i++)
        a[low+i]=tmp[i];
}

int main(){
    vector<int> a={4,2,4,5,1};
    MergeSort_recur(a);
    for(int& x:a)
        cout<<x<<" ";

    return 0;
}