include[HTML_REMOVED]
void quicksort(int q[],int i,int j);
int main()
{
int p[100];
int i,n;
scanf_s(“%d”, &n);
for (i = 0; i < n; i++)
{
scanf_s(“%d”, &p[i]);
}
int l, r;
quicksort(p,0,n-1);
for (i = 0; i < n; i++)
{
printf("%d ", p[i]);
}
return 0;
}
void quicksort(int q[], int i, int j)
{
if (i >= j) return;
int l = i - 1, r = j + 1, x = q[i + j >> 1];
while (l < r)
{
do l++; while (q[l] < x) ;
do r--; while (q[r] > x);
if (l < r)
{
int temp = q[l];
q[l] = q[r];
q[r] = temp;
}
}
quicksort(q, i, r);
quicksort(q, r+1 , j);
}