C语言 归并排序

归并排序（递归实现）

#include<stdio.h>
void swap(int k[],int low,int high)
{
        int tmp;
        tmp = k[low];
        k[low] = k[high];
        k[high] = tmp;
}
void merging(int *list1,int list1_size,int *list2,int list2_size)
{
	int temp[10];
	int i,j,k,m;
	i = j = k = 0;
	while(i<list1_size && j<list2_size)
	{
		if(list1[i] < list2[j])
		{
			temp[k++] = list1[i++];
		}
		if(list1[i] > list2[j])
		{
			temp[k++] = list2[j++];
		}
	}
	while(i<list1_size)
	{
		temp[k++] = list1[i++];
	}
	while(j<list2_size)
	{	
		temp[k++] = list2[j++];
	}
	for(m = 0;m<(list1_size + list2_size);m++)
	{	
		list1[m] = temp[m];
	}
}

void mergeSort(int k[],int n)
{
	if(n <= 1)
		return;

	int *list1 = k;
	int list1_size =  n/2;
	int *list2 = k+n/2;
	int list2_size = n - list1_size;
	
	mergeSort(list1,list1_size);
	mergeSort(list2,list2_size);
	merging(list1,list1_size,list2,list2_size);
}
int main()
{
        int i,a[10]={5,2,6,0,3,9,1,7,4,8};
        mergeSort(a,10);

        for(i = 0;i<10;i++)
                printf("%d",a[i]);

        printf("\n\n");
        return 0;
}