归并排序

#include
#include
using namespace std;

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

/*
void Merge(vector& vec, int low, int mid, int high)
{
int i = low, j = mid+1;
int len = vec.size();
vector temp(len);
for (int k = low; k <= high; ++k)
temp[k] = vec[k];
for (int k = low; k <= high; ++k)
{
if (i > mid) vec[k] = temp[j++];
else if (j > high) vec[k] = temp[i++];
else if (temp[i] < temp[j]) vec[k] = temp[i++];
else vec[k] = temp[j++];
}
}
*/

void Merge(vector& vec, int low, int mid, int high)
{
int i = low, j = mid + 1;
vector temp(high-low+1);
for (int k = low; k <= high; ++k)
temp[k-low] = vec[k];
for (int k = low; k <= high; ++k)
{
if (i > mid) vec[k] = temp[j++ - low];
else if (j > high) vec[k] = temp[i++ - low];
else if (temp[i - low] < temp[j - low]) vec[k] = temp[i++ - low];
else vec[k] = temp[j++ - low];
}
}

#include
#include
using namespace std;

//归并排序：
void Msort(vector& vec, int low, int high);
void Merge(vector& vec, int low, int mid, int high);
int main()
{
vector vec = { 2,3,4,5,15,19,16,27,36,38,44,46,47,48,50 };
//vector vec = { 3, 5, 3, 0, 8, 6, 1, 5, 8, 6, 2, 4, 9, 4, 7, 0, 1, 8, 9, 7, 3, 1, 2, 5, 9, 7, 4, 0, 2, 6 };
//vector vec = { 0,5,3,4,6,2,0 };
int len = vec.size();
Msort(vec, 0, len-1);
for (auto w : vec)
cout << w << " ";
cout << endl;
return 0;
}

2  3  4  5  15  16  19  27  36  38  44  46  47  48  50

C:\Projects_all\Work_algorithm\Project5\Debug\Project5.exe (进程 28956)已退出，返回代码为: 0。
按任意键关闭此窗口...