归并排序

#include<bits/stdc++.h>
using namespace std;

void Merging(int *list1, int list1_size, int *list2, int list2_size)
{
	int i, j, k;
	int temp[10];
	
	i = j = k = 0;
	
	while(i < list1_size && j < list2_size)
	{
		if(list1[i] < list2[j])
			temp[k++] = list1[i++];
		else
			temp[k++] = list2[j++];
	}
	
	while(i < list1_size)
	{
		temp[k++] = list1[i++];
	}
	
	while(j < list2_size)
	{
		temp[k++] = list2[j++];
	}
	
	for(int n = 0; n < (list1_size + list2_size); n++)
		list1[n] = temp[n]; 
}

void MergeSort(int k[], int n)
{
	if(n > 1)
	{
		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 a[] = {5, 2, 6, 0, 3, 9, 1, 7, 4, 8};
	
	MergeSort(a, 10);
	
	for(int i = 0; i < 10; i++)
	{
		printf("%d ", a[i]);
	}
	
	return 0;
}