#include <stdio.h>int partition(int a[],int left,int right){int pivot=a[left];while(left<right){while(left<right&amp;&amp;a[right]>=pivot){right--;}a[left]=a[right];while(left<right&amp;&amp;a[left]<=pivot){left++;}a[right]=a[left];}a[left]=pivot;return left;}void QuickSort(int a[],int left,int right){if(left<right){int pivotpos=partition(a,left,right);QuickSort(a,left,pivotpos-1);QuickSort(a,pivotpos+1,right);}}int main(){int n;scanf(&quot;%d&quot;,&amp;n);int arr[n];for(int i=0;i<n;i++){scanf(&quot;%d&quot;,&amp;arr[i]);}QuickSort(arr,0,n-1);for(int i=0;i<n;i++){printf(&quot;%d &quot;,arr[i]);}return 0;}
