include [HTML_REMOVED]
using namespace std;
const int N = 1e6 + 10;
int a[N];
int n;
void quick_sort(int a[], int l, int r)
{
if (l >= r)
{
return;
}
int x = a[l];
int i = l - 1, j = r + 1;
while (i < j)
{
do i; while (a[i] < x);
do j–; while (a[j] > x);
if (i < j)
{
swap(a[i], a[j]);
}
}
quick_sort(a, l, j);
quick_sort(a, j + 1, r);
}
int main()
{
int i;
scanf(“%d”, &n);
for(i = 0; i < n; i)
{
scanf(“%d”, &a[i]);
}
quick_sort(a, 0, n - 1);
for (i = 0; i < n; i++)
{
printf(“%d “, a[i]);
}
return 0;
}