快排板子 算法基础部分01

#include<iostream>
using namespace std;
const int N = 1e6 + 10;
int q[N];
int n;
void quick_sort(int l, int r)
{
    if (l >= r)return;
    int x = q[l], i = l - 1, j = r + 1;
    while (i < j)
    {
        do i++; while (q[i] < x);
        do j--; while (q[j] > x);
        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++)scanf_s("%d", q + i);
    quick_sort(0, n - 1);
    for (int i = 0; i < n; i++)printf("%d ", q[i]);
    return 0;
}