Class;name:quick_sort #include<cstdio> #include<iostream> using namespace std; int n,a[100001]; void quick(int i,int j){ int m,n,temp,k; m=i;n=j; k=a[(i+j)/2]; while(m<=n){ while(a[m]<k&&m<j)m++; while(a[n]>k&&n>1)n--; if(m<n){ temp=a[m];a[m]=a[n];a[n]=temp; m++;n--; } } if(m<j)quick(m,j); if(n>i)quick(i,n); } int main(){ cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; quick(1,n); for(int i=1;i<=n;i++)cout<<a[i]<<" "; return 0; }