归并排序

归并排序中的合并方式：《算法导论》中伪代码MERGE(A,p,q,r)的C语言实现

#include <malloc.h>
#define MAXLIMIT 65536

void merge(int *Array,int p,int q,int r)
{
int n1 = q - p -1;
int n2 = r - q;
int *left = (int *)malloc(sizeof(int)*(n1 + 1));
int *right = (int *)malloc(sizeof(int)*(n2 + 1));
int i,j,k;
for(i = 0;i < n;++i)
left[i] = Array[p + i];
for(j = 0;j < n2;++j)
right[j] = Array[q + j + 1];
left[n1] = MAXLIMIT;
right[n2] = MAXLIMIT;
i = 0;
j = 0;
for(k = p;k <= r;k++)
if(left[i] <= right[j])
{
Array[k] = left[i];
i++;
}
else
{
Array[k] = right[i];
j++;
}
free(left);
free(right);
}