[模板]快速排序

#include<cstdio>
#include<cstring>
inline int read(){char ch=getchar(),w=1;int x=0;while(ch<'0'||ch>'9'){if(ch=='-')w=-1;
ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return w*x;}
inline void wr(int x){if(x<0)putchar('-'),x=-x;if(x>9)wr(x/10);putchar(x%10+'0');}
inline void wrln(int x){wr(x);putchar('\n');}
int qsort(int A[],int l,int r){
	int mid=A[(l+r)>>1];
	int i=l,j=r,temp;
	do{
		while(A[i]<mid)i++;
		while(A[j]>mid)j--;
		if(i<=j){
			temp=A[i];
			A[i]=A[j];
			A[j]=temp;
			i++;
			j--;
		}
	}while(i<=j);
	if(l<j)qsort(A,l,j);
	if(i<r)qsort(A,i,r);
}
int main(){
	int n,a[100100];
	n=read();
	for(int i=1;i<=n;i++)a[i]=read();
	qsort(a,1,n);
	for(int i=1;i<=n;i++){
		if(i!=1)putchar(' ');
		wr(a[i]);
	}
	putchar('\n');
	return 0;
}