归并排序

#include <iostream>
#include <limits>
#include<stdlib.h>
using namespace std;

//归并
void merge(int A[], int len,int start,int mid,int end){
int *a = new int[mid-start+2];
int *b= new int[end-mid+1];
    a[mid-start+1]=1<<20;
    b[end-mid]=2<<20;
for(int i =0;i<mid-start+1;i++){
a[i] = A[start+i];
}
for(int i=0;i<end-mid;i++){
b[i] = A[mid+i+1];
}
int index1=0;
int index2=0;
for(int i=start;i<=end;i++){
if(a[index1]<=b[index2]){
A[i]=a[index1];
++index1;
}else{
A[i]=b[index2];
++index2;
}

}
delete a;
delete b;
return;
} 
void mergesort(int A[],int len,int i,int j){
    
    if(i<j){
int mid =(i+j)/2;
mergesort(A,len,i,mid);
mergesort(A,len,mid+1,j);
merge(A,len,i,mid,j);
   }
}
void mergeSort(int A[],int len){
if(A==NULL||len<=0)
return;
mergesort(A,len,0,len-1);
return;
}

int main(int argc, char** argv) {
int A[9];
A[0]=0;
A[1]=3;
A[2]=4;
A[3]=-1;
A[4]=9;
A[5]=7;
A[6]=8;
A[7]=8;
A[8]=80;
        A[9]=-90;
mergeSort(A,10);

for(int i = 0;i<10;i++){
cout<<A[i]<<",";
}
cout<<endl; 
return 0;

}