C++编程归并排序算法实现示例

void merg_sort(int* a, int fbegin, int fend, int sbegin, int send, int* b)
{
	int L = fbegin;
	int R = sbegin;
	int cursize = fbegin;//z这里不能重0开始 递归后面是按对应开始位置进行赋值的 
	while (L <= fend && R <= send)
	{
		if (a[L] > a[R])
		{
			b[cursize++] = a[R++];
		}
		else
		{
			b[cursize++] = a[L++];
		}
	}
	while (L <= fend)
	{
		b[cursize++] = a[L++];
	}
	while (R <= send)
	{
		b[cursize++] = a[R++];
	}
	memcpy(a+fbegin, b+fbegin, sizeof(int) * (send-fbegin+1));
  //要开始位置进行赋值不然后面递归会造成重复对同一个地方赋值 
}

void Merg_sort(int* a, int left, int right, int* b)
{
 	int min = (left + right) / 2;
	if (left < right) 
	{
		Merg_sort(a, left, min, b);//将左边的分开
		Merg_sort(a, min + 1, right, b);//将右边的分开
		merg_sort(a, left, min, min + 1, right, b);//逆过程 先分开后排序 后分开的先排序 
	}
}

int main()
{
 	int a[10] = { 1,3,4,9,9,2,4,15,17,10 };
	int b[10];
	Merg_sort(a, 0, 9, b);
	for (int i = 0; i < 10; i++)
	{
		printf("%d\t", a[i]);
	}
	return 0;
}