include[HTML_REMOVED]
using namespace std;
const int N=100010;
int A[N];
int quick(int A[],int low,int high){
int pivot=A[low];
while(low[HTML_REMOVED]=pivot){
high–;
}
A[low]=A[high];
while(low[HTML_REMOVED]>n;
for(int i=0;i[HTML_REMOVED]>A[i];
}
quick_sort(A,0,n-1);
for(int i=0;i<n;i++){
cout<<A[i]<<” “;
}
return 0;
}