`#include[HTML_REMOVED]
using namespace std;
const int N = 1e6+10;
int n;
int A[N];

void quickSort(int A[], int l, int r){
if(l >= r) return;
int x = A[(l+r)/2];
int i = l, j = r;
while (i <= j)
{
while( A[i] < x) i;
while (A[j] > x) j–;
if(i <= j){
swap(A[i],A[j]);
i;
j–;
};
}
quickSort(A, l, j);
quickSort(A, i, r);
}

int main(){
scanf(“%d”,&n);
for(int i = 0;i < n;i){
scanf(“%d”,&A[i]);
}
quickSort(A,0,n-1);
for(int i = 0;i < n;i){
printf(“%d “,A[i]);
}
return 0;
}`