简单的C语言归并排序实现代码

#include <STDIO.H>
#include <MALLOC.H>
#include <STDLIB.H>


typedef int elemType;
void merge(elemType *arr,int start,int mid,int end)
{
int start_t = start;
int mid_t = mid;
int j = 0;
elemType *tempArr = (elemType*)malloc(sizeof(elemType)*(end-start+1));
if (NULL == tempArr)
exit(1);
while(start<mid_t && mid<=end)
{
if (arr[start] >= arr[mid])
tempArr[j++] = arr[mid++];
else
tempArr[j++] = arr[start++];
}
while (start<mid_t)
{
tempArr[j++] = arr[start++];
}
while (mid<=end)
{
tempArr[j++] = arr[mid++];
}
for (j=0;start_t<=end;++j)
{
arr[start_t++] = tempArr[j];
}
free(tempArr);
}
void mergeSort(elemType *arr,int start,int end)
{
if (NULL == arr) return ;
if (end>start)
{
mergeSort(arr,start,(end+start)/2);
mergeSort(arr,(end+start)/2+1,end);
merge(arr,start,(end+start)/2+1,end);
}
}


void printArr(elemType *arr,int arrSize)
{
int i=0;
while (i<arrSize)
{
printf("%d ",arr[i++]);
}
printf("\n");
}


int main(void)
{
elemType arr[]={1,5,4,2,6,9,2,3,11,0,56,232,561,2,6,11,2};
int size = sizeof(arr)/sizeof(elemType);
printf("排序前：");
printArr(arr,size);
mergeSort(arr,0,size-1);
printf("排序后：");
printArr(arr,size);
return 0;

}

结果：