快速排序 — c++

#include<iostream>

using namespace std;

const int N = 10005;

int a[N], n;

void qsort(int le, int ri)
{
	if(le > ri) return;
	
	int t = a[le];
	int i = le, j = ri;
	int f;
	
	while(i != j)
	{
		while(a[j] >= t && i < j)
			j --;
		while(a[i] <= t && i < j)
			i ++;
		
		if(i < j)
		{
			f = a[i];
			a[i] = a[j];
			a[j] = f;
		}
	}
	a[le] = a[i];
	a[i] = t;
	
	qsort(le, i - 1);
	qsort(i + 1, ri);
	
}

int main()
{
	cin >> n;
	for(int i = 1; i <= n; i ++)
		scanf("%d", &a[i]);
	
	qsort(1, n);
	
	for(int i = 1; i <= n; i ++)
		printf("%d ", a[i]);
	
	return 0;
}