二路归并排序(完整代码C)

#include<stdio.h>
#include<stdlib.h>
#define maxSizw 100

void merge(int a[],int low,int mid,int high)
{
int i,j,k;
int n1=mid-low+1;
int n2=high-mid;
int L[n1],R[n2];
for(i=0;i<n1;i++) //前半段转存到L数组
L[i]=a[low+i];
for(j=0;j<n2;j++) //后半段转存到L数组
R[j]=a[mid+1+j];
i=0;
j=0;
k=low;
while(i<n1&&j<n2) //归并关键代码
{
if(R[j]>=L[i])
a[k]=L[i++];
else
a[k]=R[j++];
k++;
}
while(i<n1) //将任何一个有剩余数字的数组全部依次并入
a[k++]=L[i++];
while(j<n2)
a[k++]=R[j++];
}

void mergeSort(int a[],int low,int high)
{
if (low<high)
{
int mid= (low+high)/2;
mergeSort(a, low, mid);
mergeSort(a, mid+1, high);
merge(a, low, mid, high);
}
}

void print(int a[],int n)
{
int i;
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
}

int main()
{
	int array[]={4,3,6,9,7,1,2,4,5,0};
	int n=10;
	int low=0;
	int high=9;
	mergeSort(array,low,high);
	print(array,n);	
}