2.归并排序——分治

归并排序

步骤：

1. 确定分界点mid=(l+r)/2,即中点；
2. 递归排序left,right;
3. 归并合二为一；

代码：

#define _CRT_SECURE_NO_WARNINGS//用于解决vs2022使用scanf报错
#include <iostream>

using namespace std;

const int N = 1e6 + 10;

int n;
int q[N];
int tmp[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]) tmp[k++] = q[i++];
		else tmp[k++] = q[j++];
	}
	while (i <= mid) tmp[k++] = q[i++];
	while (j <= r) tmp[k++] = q[j++];
	for (i = l, j = 0; i <= r; i++, j++)
	{
		q[i] = tmp[j];
	}
}


int main()
{
	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]);
	
	return 0;
}

测试：

输入：

5
9 6 3 5 4

输出：

34569