#include<stdio.h>
void quickSort(int arr[],int left,int right)
{
    if(left>=right) return;
    int i=left,j=right;
    int pivot=arr[i];
    while(i<j)
    {
        while(i<j&&arr[j]>=pivot) j--;
        arr[i]=arr[j];
        while(i<j&&arr[i]<=pivot) i++;
        arr[j]=arr[i];
    }
    arr[i]=pivot;
    quickSort(arr,left,i-1);
    quickSort(arr,i+1,right);
}
int main()
{
    int n,a[10001],i;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    quickSort(a,0,n-1);
    for(i=0;i<n;i++)
    {
        printf("%d",a[i]);
        if(i!=n-1) printf(" ");
        else printf("\n");
    }
    return 0;
}
 ```c