[算法][笔记]快速排序-笔记板子

快速排序

#include <bits/stdc++.h>
using namespace std;
#define mian main
const int N = 1e5 + 10;
long long int q[N];

void quick_sort(long long int q[],int l,int r)
{
    if(l >= r) return ;
    int x = q[l + r >> 1],i = l - 1,j = r + 1;
    while(i < j){
        while(q[++i] < x);
        while(q[--j] > x);
        if(i < j)swap(q[i],q[j]);
    }
    quick_sort(q,l,j);
    quick_sort(q,j + 1,r);
}

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