快速排序

[c++]代码库

#include<iostream>

using namespace std;

const int N =1e6 +10;

void my_quick_sort(int q[], 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]);
    }
    my_quick_sort(q,l,j);
    my_quick_sort(q,j+1,r);
}

int main()
{
    int n;
    
    cin >> n;
    
    int q[N];
    
    for(int i = 0; i < n; i++)
    {
        cin >> q[i];
    }
    
    my_quick_sort(q,0,n-1);
    
    for(int i = 0; i < n-1; i++)
    {
        cout << q[i] <<' ';
    }
    cout << q[n-1];
    return 0;
}