include[HTML_REMOVED]
using namespace std;
const int N=100010;
int a[N];
int part (int a[],int low ,int high){
int i = low ,j = high, base = a[low+high>>1];
while(i[HTML_REMOVED]=base)j–;
if(i<j) swap(a[i],a[j]);
while(i<j&&a[i]<base)i;
if(i<j) swap(a[i],a[j–]);
}
return i;
}
int quick_sort(int a[],int low ,int high){
int mid;
if(low<high){
mid = part(a,low,high);
quick_sort(a,low,mid-1);
quick_sort(a,mid+1,high);
}
}
int main()
{
int n;
scanf(“%d”, &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &a[i]);
quick_sort(a, 0, n - 1);
for (int i = 0; i < n; i ++ ) printf("%d ", a[i]);
return 0;
}