137

lailailailai

tiaotiao2011
Sola_

using namespace std;

const int N =1e6+10;

int q[N];

void quick_sort(int q[],int l,int r)
{ if(l==r) return;
int x = q[(l+r)/2], i= l - 1, 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;
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;
}

# include[HTML_REMOVED]

using namespace std;

const int N =1e6+10;

int q[N];

void quick_sort(int q[],int l,int r)
{ if(l==r) return;
int x = q[(l+r)/2], i= l - 1, 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;
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;
}

AcWing《算法基础课》拼团优惠！https://www.acwing.com/activity/content/introduction/11/group_buy/106709/

AcWing《算法基础课》拼团优惠！还差一个人呢兄弟们https://www.acwing.com/activity/content/introduction/11/group_buy/106709/

AcWing《算法基础课》拼团优惠！https://www.acwing.com/activity/content/introduction/11/group_buy/106709/