include[HTML_REMOVED]

using namespace std;
const int N=100010;
int q[N];
void quick_sort(int q[],int l,int r)
{
if(l==r)return;
int x=q[l+r>>1];//位运算，相当于去中间数
int i=l-1;
int j=r+1;
while(i[HTML_REMOVED]x);
if(i<j)swap(q[i],q[j]);
}
quick_sort(q,l,j);
quick_sort(q,j+1,r);
}
int main()
{
int n;
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;
}