merge sort归并排序

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#define MAX 100

void merge_sort(int arr[],int size)
{
if(size < 2)
{
return;
}
size_t mid= size >> 1;
merge_sort(arr,mid);
merge_sort(arr+mid,size-mid);
merge(arr,size,mid);
}

void merge(int arr[], int size, int mid)
{
int i=0;
int left_sta=0;
int right_sta=mid;

int* buff=(int*)malloc(size*sizeof(int));
while(left_sta<mid && right_sta<size)
{
if(arr[left_sta]<arr[right_sta])
{
buff[i++]=arr[left_sta];
left_sta++;
}
else
{
buff[i++]=arr[right_sta];
right_sta++;
}
}

while(left_sta<mid)
{
buff[i++]=arr[left_sta];
left_sta++;
}


while(right_sta<size)
{
buff[i++]=arr[right_sta];
right_sta++;
}

for(i=0;i<size;i++)
{
arr[i]=buff[i];
}
}

int main()
{
int arr[MAX]={0};

int i=0;

int j=0;
srand((int)time(0));
for (j=0;j<MAX ;j++ )
{
arr[j]=rand()%200;
}

int arr_len=sizeof(arr)/sizeof(int);
for(i=0;i<arr_len;i++)
{
printf("%d ",arr[i]);
}
printf("\n");
clock_t begin=clock();
merge_sort(arr,arr_len);
clock_t end=clock();
for(i=0;i<arr_len;i++)
{
printf("%d ",arr[i]);
}
printf("\n");
printf("CLOCKS_PER_SEC is :%d\n",CLOCKS_PER_SEC);
printf("the runtime is %f\n",(double)(end-begin)/CLOCKS_PER_SEC);

}