#include <iostream>
using namespace std;
void MERGE_SORT(int *&A,int begin,int end);
void MERGE(int *&A,int begin,int middle,int end);
int main()
{
int num;
int *data;
cout<<"输入你想要排序的数组的长度:"<<endl;
cin>>num;
cout<<"依次输入你想要排序的数组:"<<endl;
data = new int[num];
for (int i=0;i<num;i++){
cin>>data[i];
}
MERGE_SORT(data,0,num-1);
for (int i=0;i<num;i++){
cout<<data[i]<<" ";
}
}
void MERGE(int *&A,int begin,int middle,int end){
int total=end-begin+1;
//这一句是用来计算整个待排序的数的总数。
int n1=middle-begin+1;
int n2=end-middle;
int *data1=new int[n1+1];
int *data2=new int[n2+1];
for (int i=0;i<n1;i++)
data1[i]=A[begin+i];
for (int i=0;i<n2;i++)
data2[i]=A[middle+i+1];
data1[n1]=INT_MAX;
data2[n2]=INT_MAX;
int m=0;
int n=0;
for (int i=0;i<total;i++){
if(data1[m]>data2[n]){
A[begin+i]=data2[n];
n++;
}else {
A[begin+i]=data1[m];
m++;
}
}
}
void MERGE_SORT(int *&A,int begin,int end){
if (begin<end){
int middle;
middle=(begin+end)/2;
MERGE_SORT(A,begin,middle);
MERGE_SORT(A,middle+1,end);
MERGE(A,begin,middle,end);
}
}
using namespace std;
void MERGE_SORT(int *&A,int begin,int end);
void MERGE(int *&A,int begin,int middle,int end);
int main()
{
int num;
int *data;
cout<<"输入你想要排序的数组的长度:"<<endl;
cin>>num;
cout<<"依次输入你想要排序的数组:"<<endl;
data = new int[num];
for (int i=0;i<num;i++){
cin>>data[i];
}
MERGE_SORT(data,0,num-1);
for (int i=0;i<num;i++){
cout<<data[i]<<" ";
}
}
void MERGE(int *&A,int begin,int middle,int end){
int total=end-begin+1;
//这一句是用来计算整个待排序的数的总数。
int n1=middle-begin+1;
int n2=end-middle;
int *data1=new int[n1+1];
int *data2=new int[n2+1];
for (int i=0;i<n1;i++)
data1[i]=A[begin+i];
for (int i=0;i<n2;i++)
data2[i]=A[middle+i+1];
data1[n1]=INT_MAX;
data2[n2]=INT_MAX;
int m=0;
int n=0;
for (int i=0;i<total;i++){
if(data1[m]>data2[n]){
A[begin+i]=data2[n];
n++;
}else {
A[begin+i]=data1[m];
m++;
}
}
}
void MERGE_SORT(int *&A,int begin,int end){
if (begin<end){
int middle;
middle=(begin+end)/2;
MERGE_SORT(A,begin,middle);
MERGE_SORT(A,middle+1,end);
MERGE(A,begin,middle,end);
}
}