快排 + 归并排序

#include<bits/stdc++.h>
using namespace std;
const int N = 1000007;
int a[N], temp[N];
void quick_sort(int a[], int l, int r)
{
	if (l >= r) return;
	int x = a[l+r>>1], i = l - 1, j = r + 1;
	while (i < j)
	{
		do i++; while (a[i] < x);
		do j--; while (a[j] > x);
		if (i < j) swap(a[i], a[j]);
	}
	quick_sort(a, l, j);
	quick_sort(a, j + 1, r);
}
void merge_sort(int a[], int l, int r)
{
	if (l >= r) return;
	int mid = l + r >> 1;
	merge_sort(a, l, mid), merge_sort(a, mid + 1, r);//均分区间
	int k = 0, i = l, j = mid + 1;
	while (i <= mid && j <= r)//递归排序
		if (a[i] <= a[j]) temp[k++] = a[i++];
		else temp[k++] = a[j++];
	while (i <= mid) temp[k++] = a[i++];
	while (j <= r) temp[k++] = a[j++];
	for (int i = l, j = 0; i <= r; j++, i++)//归并序列
		a[i] = temp[j];

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