简单快速排序板子

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iomanip>;
using namespace std;


const int maxn = 1e5 + 10;
int b[maxn];
int n;
void qst(int l, int r) {
	if (l >= r) return;
	int tmp = b[l];
	int i = l, j = r;
	while (i < j) {
		while (b[j] >= tmp && i < j) j--;
		while (b[i] <= tmp && i < j) i++;		
		swap(b[i], b[j]);
	}
	b[l] = b[j];
	b[j] = tmp;
	qst(l, j - 1);
	qst(j + 1, r);
}


int main(){
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> b[i];
	}
	qst(1, n);
	for(int i = 1; i <= n; i++) cout << b[i] << " ";
	
}