分治排序C语言实现

分治排序法（基于算法导论伪代码直接硬套实现）：

int mMerge(int array[], unsigned int p, unsigned int q, unsigned int r){
	unsigned int n1 = q - p + 1;
	unsigned int n2 = r - q;
	unsigned int i = 0;
	unsigned int j = 0;
	unsigned int k = 0;
	//printf("%d---%d \n",n1,n2);
	int* arrLow = (int*)malloc((n1 + 1) * sizeof(int));
	int* arrTall = (int*)malloc((n2 + 1) * sizeof(int));
	for (i = 0; i < n1; i++){
		arrLow[i] = array[p + i];
	}
	for (j = 0; j < n2; j++){
		arrTall[j] = array[q+1 + j];
	}
	i = 0; j = 0;
	arrLow[n1] = 0x7fffffff;
	arrTall[n2] = 0x7fffffff;
	for (k = p; k <= r; k++){
		if (arrLow[i] <= arrTall[j]){
			array[k] = arrLow[i];
			i++;
		}
		else{
			array[k] = arrTall[j];
			j++;
		}
		//printf("%02X ", array[k]);
	}
	free(arrLow);
	free(arrTall);
	return 0;
}
int mMergeSort(int array[],unsigned int p,unsigned int r){
	if (p < r){
		int q = (p + r) / 2;
		mMergeSort(array, p, q);
		mMergeSort(array, q+1 , r);
		mMerge(array, p, q, r);
	}
	return 0;
}

更优雅适合实际应用的实现：

void mergearray(int a[], int first, int mid, int last, int temp[])	//将两个有序数组合并排序 
{
	int i = first, j = mid + 1;
	int m = mid, n = last;
	int k = 0;
	while (i <= m&&j <= n)
	{
		if (a[i]<a[j])
			temp[k++] = a[i++];
		else
			temp[k++] = a[j++];
	}
	while (i <= m)
		temp[k++] = a[i++];
	while (j <= n)
		temp[k++] = a[j++];
	for (i = 0; i<k; i++)
		a[first + i] = temp[i];
}

void mergesort(int a[], int first, int last, int temp[])	//将两个任意数组合并排序 
{
	if (first<last)
	{
		int mid = (first + last) / 2;
		mergesort(a, first, mid, temp);	//左边有序 
		mergesort(a, mid + 1, last, temp);	//右边有序 
		mergearray(a, first, mid, last, temp);	//再将两个有序数组合并 
	}
}

bool MergeSort(int a[], int n)
{
	int *p = new int[n];  //分配一个有n个int型元素的数组所占空间，并将该数组的第一个元素的地址赋给int *型指针p。
	if (p == NULL)
		return false;
	mergesort(a, 0, n - 1, p);
	delete[] p;
	return true;
}

简单验证：

int main(){
	int arr[8] = {5,2,4,7,1,3,2,6};
	MergeSort(arr, 8);
	mMergeSort(arr,0,7);
	for (int i = 0; i<8; i++)
		printf("%d ", arr[i]);

	system("pause");
	return EXIT_SUCCESS;
}

借鉴：https://blog.csdn.net/doubleguy/article/details/81390951