分治排序的C/C++实现

//分治排序
#include<iostream>
void merge(int arr[],int p,int r);
void merge_sort(int arr[],int p,int q,int r);
using namespace std;
int main(){

const int index=10;
int a[index]={15,12,45,63,8,5,69,57,12,36};
merge(a,0,9);
for(int i=0;i<index;i++)
cout<<a[i]<<endl;
return 0;
}
void merge(int arr[10],int p,int r){
if(p<r){
int q=(p+r)/2;
merge(arr,p,q);
merge(arr,q+1,r);
merge_sort(arr,p,q,r);
}
}
void merge_sort(int arr[10],int p,int q,int r){
int n=q-p+2,m=r-q+1;
int *left=new int
,*right=new int[m];
for(int i=0;i<n-1;i++)
{
left[i]=arr[p+i];
}
for(int j=0;j<m-1;j++)
{
right[j]=arr[q+1+j];
}
left[n-1]=32767;
right[m-1]=32767;
i=0;
j=0;
for(int t=p;t<r+1;t++)
{
if(left[i]<=right[j]){
arr[t]=left[i];
i++;
}
else{
arr[t]=right[j];
j++;
}
}
delete [] left;
delete [] right;
}