include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
const int N=1e6 + 10;
int q[N];
int n;
void quick_sort(int q[],int l,int r)
{
if(l>=r) return;
int i=l-1,j=r+1,mid=q[i+j>>1];
while(i[HTML_REMOVED]mid);//j移动一位
if(i<j) swap(q[i],q[j]);//移动完毕
}
quick_sort(q,l,j);
quick_sort(q,j+1,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]);
printf(” “);
}
return 0;
}