【C++代码】之《归并排序》

#include <iostream>
#include <vector>
#include <assert.h>
using namespace std;

void Merge(vector<int> & vec, int start, int mid, int end)
{
    vector<int> tempArray;
    int p1 = start;
    int p2 = mid + 1;
    while (p1 <= mid && p2 <= end)
    {
        if (vec[p1] <= vec[p2])
        {
            tempArray.push_back(vec[p1++]);
        }
        else
        {
            tempArray.push_back(vec[p2++]);
        }
    } 
    while (p1 <= mid)
    {
        tempArray.push_back(vec[p1++]);
    }
    while (p2 <= end)
    {
        tempArray.push_back(vec[p2++]);
    }
    for (int i = 0; i < tempArray.size(); ++i)
    {
        vec[i + start] = tempArray[i];
    }
}

void MergeSort(vector<int> & vec, const int & start, const int & end)
{
    if (start < end)
    {
        const int mid = (start + end) / 2;
        MergeSort(vec, start, mid);
        MergeSort(vec, mid + 1, end);
        Merge(vec, start, mid, end);
    }   
}


void MergeSort(vector<int> & vec)
{
    const int length = vec.size();
    if (length <= 1)
    {
        return ;
    }
    else
    {
        MergeSort(vec, 0, length - 1);
    }
}




int main()
{
    vector<int> vec = {4, 5, 7, 1, 3, 9};
    for (int i = 0; i < vec.size(); ++i)
    {
        cout << vec[i] << '\t';
    }
    cout << endl;
    MergeSort(vec);
    for (int i = 0; i < vec.size(); ++i)
    {
        cout << vec[i] << '\t';
    }
    cout << endl;

    return 1;
}