快速排序--acwing-- 经典模板

#include<iostream>
using namespace std;
const int N = 100010;
int q[N], n;
void swap(int& a, int& b)
{
    int tmp = a;
    a = b;
    b = tmp;
}

void quick_sort(int l, int r)
{
    if (l >= r) return;
    int i = l - 1, j = r + 1, val = q[l + r >> 1];

    while (i < j)
    {
        do i++; while (q[i] < val);
        do j--; while (q[j] > val);

        if (i < j) swap(q[i], q[j]);
    }

    quick_sort(l, j);
    quick_sort(j + 1, r);
}
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++) cin >> q[i];

    quick_sort(0, n - 1);

    for (int i = 0; i < n; i++) cout << q[i] << ' ';
    cout << endl;
    return 0;
}