😍 归并排序

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

template<typename T>
void printVec(vector<T>&t) {
    for (T& i : t) {
        cout << i << " ";
    }
    cout << endl;
}

void Merge(vector<int>&vec,int low,int mid,int high) {
    vector<int>temp;
    int i = low, j = mid + 1;
    while (i <= mid && j <= high) {
        if (vec[i] < vec[j]) {
            temp.push_back(vec[i++]);
        }
        else {
            temp.push_back(vec[j++]);
        }
    }
    while (i <= mid) {
        temp.push_back(vec[i++]);
    }
    while (j <= high) {
        temp.push_back(vec[j++]);
    }
    for (i = 0; i < temp.size(); i++) {
        vec[i + low] = temp[i];
    }
    temp.clear();
}

void MergeSort(vector<int>&vec,int low,int high) {
    if (low>=high) { return; }
    int mid =(high+low) / 2;
    MergeSort(vec,low,mid);
    MergeSort(vec,mid+1,high);
    Merge(vec, low, mid, high);
}

int main(int argc,char**argv) {
    vector<int>vec = { 67,45,23,1,4,6,87,34,13 };
    int size = vec.size();
    MergeSort(vec,0,size-1);
    printVec<int>(vec);
    return 0;
}

//1 4 6 13 23 34 45 67 87