排序算法系列：归并排序(Merge sort)（C语言）

通俗理解：运用分而治之的思想，编写递归函数，将大数组排序转化为小数组排序，最后再将其合并。

void merge_sort(int*p,int low,int high)
{
	int mid = (low+high)/2;
	if (low <high)
	{
		merge_sort(p,low,mid);
		merge_sort(p,mid+1,high);
		merge(p,low,mid,high);
	}
}

void merge(int *p,int low,int mid,int high)
{
	int i,k;
	int* temp = (int*)malloc((high-low+1)*sizeof(int));//合并空间
	int start1 = low;
	int end1 = mid;
	int start2 = mid+1;
	int end2 = high;
	//比较两个指针所指向的元素，选择相对小的元素放入到合并空间，并移动指针到下一位置
	for (k = 0;start1<=end1 && start2<=end2;k++)
	{
		if (p[start1]<p[start2])
			temp[k] = p[start1++];
		else
			temp[k] = p[start2++];
	}
	//检测剩余项，若有剩余，直接拷贝出来粘到合并序列尾
	while (start1<=end1)
		temp[k++] = p[start1++];
	while (start2<=end2)
		temp[k++] = p[start2++];
	//将