归并排序算法c++实现
#include<iostream>
#include<vector>
using namespace std;
void merge(vector<int>&vec,int left,int rightBegin,int rightbound)
{
int i = left;
int j = rightBegin;
int k = 0;
vector<int>vecTmp(rightbound - left+1,0);
while(i < rightBegin && j <= rightbound)
{
if(vec[i] <= vec[j] )//注意此处包含等于,保证归并排序的稳定性
{
vecTmp[k++] = vec[i++];
}
else
{
vecTmp[k++] = vec[j++];
}
}
while(i < rightBegin)
{
vecTmp[k++] = vec[i++];
}
while(j <= rightbound)
{
vecTmp[k++] = vec[j++];
}
for(int m = 0;m<k;m++)
{
vec[left+m] = vecTmp[m];
}
return;
}
void mergeSort(vector<int>&vec,int left,int right)
{
if(left >= right)
return;
int mid = 0;
mid = left + (right - left)/2; //防止int溢出
mergeSort(vec,left,mid);
mergeSort(vec,mid+1,right);
merge(vec,left,mid+1,right);
return;
}
int main()
{
//mergesort
int a[] = {2,8,7,4,0,3,5,9,1,6};
vector<int>vec(a,a+10);
mergeSort(vec,0,vec.size()-1);
return 0;
}