归并排序(C语言)

基本思想

归并排序是建立在归并操作上的一种有效的排序算法,该算法是采用分治法的一个非常典型的应用。将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为二路归并。

递归实现

//归并排序
void MergeSort(int* a, int sz)
{
	int* tmp = (int *)malloc((sizeof(int)) * (sz - 1));
	_MergeSort(a, 0, sz - 1,tmp);
}

void _MergeSort(int* a, int left, int right,int* tmp)
{
	if (left >= right)
		return;

	int mid = (left + right) / 2;

	//分解
	_MergeSort(a, left, mid,tmp);
	_MergeSort(a, mid+1,right,tmp);
	
	//合并
	int begin1 = left, end1 = mid;
	int begin2 = mid + 1, end2 = right;
	int index = left;
	while (begin1 <= end1 && begin2 <= end2)
	{
		if (a[begin1] < a[begin2])
		tmp[index++] = a[begin1++];
		
		else
			tmp[index++] = a[begin2++];
	}
	while (begin1 <= end1)
		tmp[index++] = a[begin1++];

	while (begin2 <= end2)
		tmp[index++] = a[begin2++];

	memcpy(a + left, tmp + left, (right - left + 1)*4);
}

非递归实现

归并排序采取的是严格二分，因此归并的非递归实现较为简单，并不需要模拟栈的开辟，只需要令gap=1，进行合并，再领gap*2，直至gap<sz

void MergeSortNonR(int* a, int sz)
{
	int* tmp = (int*)malloc(sizeof(int) * (sz - 1));

	int gap = 1;

	int i = 0;

	while (gap<sz)
	{
		for (i = 0; i < sz; i = i + gap * 2)
		{
			int begin1 = i, end1 = i + gap - 1;
			int begin2 = i + gap, end2 = i + 2 * gap - 1;
			int index = i;
			//当end1超过sz
			if (end1 >= sz)
				end1 = sz - 1;

			//当begin2超过sz，令[begin2,end2]不存在
			if (begin2 >= sz)
			{
				begin2 = 1;
				end2 = 0;
			}
			//	end2超过sz
			if (begin2 < sz && end2 >= sz)
				end2 = sz - 1;

			while (begin1 <= end1 && begin2 <= end2)
			{
				if (a[begin1] <= a[begin2])
					tmp[index++] = a[begin1++];
				else
					tmp[index++] = a[begin2++];

			}
			while (begin1 <= end1)
				tmp[index++] = a[begin1++];

			while (begin2 <= end2)
				tmp[index++] = a[begin2++];
		}
		memcpy(a, tmp, 4 * sz);
		gap *= 2;
	}
}