acwing 787 归并排序

思路：不断将数组对半分，递归间数组分成单个数后再将不同组通过大小比较进行归并存入临时数组中，与快排的区别是归并排序先递归后排序归并严格对半分，快排先整体排序再递归排序各子数组。

#include<iostream>
const int N = 100010;
int q[N], temp[N];
//归并排序找中间段想将数据分割成有序字段再运用双指针归并
void merge_sort(int q[], int l, int r)
{
	if (l >= r)
		return;
	int mid = l + r >> 1;//相当于（l+r）/2,二进制逻辑右移
	merge_sort(q, l, mid);
	merge_sort(q, mid + 1, r);
	int k = 0, i = l, j = mid + 1;
	while (i <= mid && j <= r)
	{
		if (q[i] <= q[j])
			temp[k++] = q[i++];
		else
			temp[k++] = q[j++];
	}
	while (i <= mid)
			temp[k++] = q[i++];
	while (j <= r)
			temp[k++] = q[j++];
	for (int i = l, j = 0; i <= r; i++, j++)
	{
		q[i] = temp[j];
	}
}

int main()
{
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
	{
		scanf("%d", &q[i]);
	}
	merge_sort(q, 0, n - 1);
	for (int i = 0; i < n; i++)
		printf("%d ", q[i]);
}