快速排序

#include <iostream>

using namespace std;

const int N = 1e6 + 10;
int q[N];

void quick_sort(int q[], int left, int right) {
    if(left>=right) return;
    int x= q[left],i=left-1,j=right+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(q,left,j);
    quick_sort(q,j+1,right);



}

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