q sort(报错模板)

#include<bits/stdc++.h>

using namespace std;

const int N=1e5+10;

int n,a[N];

void quick(int l,int r){

	if(l>=r)return ;

	int mid=l+r>>1,i=l-1,j=r+1;

	while(i<=j){

		do i++;while (a[i]<a[mid]);

		do j--;while (a[j]>a[mid]);

		if(i<j) swap(a[i],a[j]);

	}

	quick(l,j);

	quick(j+1,r);

}

int main(){

scanf("%d",&n);

for(int i=1;i<=n;i++)scanf("%d",&a[i]);

quick(1,n);

for(int i=1;i<=n;i++)printf("%d ",a[i]);

	return 0;

}