归并排序
void merge1(int *a,int left,int mid,int right){
int n1=mid-left+1;
int n2=right-mid;
int *arr1=new int[n1];
int *arr2=new int[n2];
for(int i=0;i
void merge1(int *a,int left,int mid,int right){
int n1=mid-left+1;
int n2=right-mid;
int *arr1=new int[n1];
int *arr2=new int[n2];
for(int i=0;i