快排超时

#include <bits/stdc++.h>
using namespace std;
int n,a[100000005];
void qsort(int left, int right){
	if (left > right) return;
	int i = left;
	int j = right;
	int temp = a[left];
	while (i != j){
		while (a[j] >= temp && i < j) j --;
		while (a[i] <= temp && i < j) i ++;
		if (i < j) swap (a[i],a[j]);
	}
	a[left] = a[i];
	a[i] = temp;
	qsort (left, i-1);
	qsort (i+1, right);
	return ;
}
int main(){
	cin>>n;
	for (int i = 1; i <= n; i ++){
		cin>>a[i];
	}
	qsort (1,n);
	for (int i = 1; i <= n; i ++){
		cout<<a[i]<<" ";
	}
	return 0;
}