include[HTML_REMOVED]
using namespace std;
const int N = 1e6 + 10;
int n;
int q[N];
void quick_sort(int q[],int l,int r)
{
//出口
if (l>=r) return;
//定义x时,注意边界
int x =q[(l+r+1)/2],i = l-1,j = r+1;
while(i[HTML_REMOVED]x);
if (i<j) swap(q[i],q[j]);
}
// 递归
quick_sort(q,l,i-1);
quick_sort(q,i,r);
}
int main()
{
scanf(“%d”,&n);
for(int i=0;i<n;i) scanf(“%d”,&q[i]);
quick_sort(q,0,n-1);
//注意空格
for(int i=0;i<n;i) printf(“%d “,q[i]);
return 0;
}