归并排序(时间复杂度O(nlgn)(最坏))

#include<stdio.h>   
#include <math.h>
#include <string>
#define m 11
void merge(int arr[],int low,int mid,int high)
{
int k,begin1 =low,end1 = mid,begin2 = mid+1,end2 = high;
int *temp = (int*)malloc((high - low +1)*sizeof(int));
for(k =0;begin1 <=end1&&begin2 <=end2;++k)
{
if(arr[begin1]<=arr[begin2])
temp[k] = arr[begin1++];
else
temp[k] = arr[begin2++];
}
if(begin1 <=end1)
memcpy(temp+k,arr+begin1,(end1-begin1+1)*(sizeof(int)));
if(begin2 <=end2)
memcpy(temp+k,arr+begin2,(end2-begin2+1)*(sizeof(int)));
memcpy(arr+low,temp,(high - low +1)*(sizeof(int)));
free(temp);
}


void merge_sort(int arr[],unsigned int first,unsigned int last)
{
int mid = 0;
if(first < last)
{
mid = (first + last)/2;
merge_sort(arr,first,mid);
merge_sort(arr,mid+1,last);
merge(arr,first,mid,last);
}
}


  
int main()   
{   
    int arr[m],i;
for(i =0;i<m;i++)
{
scanf("%d",&arr[i]);
}
merge_sort(arr,0,m-1);
for(i =0;i<m;i++)
{
printf("%d ",arr[i]);
}
    return 0;   
}