#include <iostream>
#include <vector>
using namespace std;
void merge(vector<int> &ivec, int p, int q, int r )
{
int nl=q-p+1;
int nr=r-q;
int *L=new int[nl];
int *R=new int[nr];
for(int i=0;i<nl;i++)
{
L[i]=ivec[p+i];
}
for(int j=0;j<nr;j++)
{
R[j]=ivec[q+j+1];
}
int m=0;
int n=0;
for(int k=p;k<=r;k++)
{
if(m<nl && n<nr)
{
ivec[k]=L[m]<R[n]?L[m++]:R[n++];
}
else if(m<nl)
{
ivec[k]=L[m++];
}
else
{
ivec[k]=R[n++];
}
}
delete [] L;
delete [] R;
}
void mergeSort(vector<int> &ivec, int p, int r )
{
if(p<r)
{
int q=(p+r)/2;
mergeSort(ivec,p,q);
mergeSort(ivec,q+1,r);
merge(ivec,p,q,r);
}
}
int main()
{
cout<<"enter a list of numbers:(ctrl+z to end)"<<endl;
vector<int> ivec;
int val;
while(cin>>val)
ivec.push_back(val);
mergeSort(ivec,0,ivec.size()-1);
cout<<"排序后:"<<endl;
for(vector<int>::size_type i=0;i<ivec.size();i++)
{
cout<<ivec[i]<<" ";
}
return 0;
}