include[HTML_REMOVED]
using namespace std;
int a[10010];
void quick_sort(int a[],int l,int r)
{
if(l>=r)return;
int i=l-1,j=r+1,x=a[l]+a[r]>>1;
while(i[HTML_REMOVED]x);
if(i[HTML_REMOVED]>n;
for(int i=0;i[HTML_REMOVED]>a[i];
quick_sort(a,0,n-1);
for(int i=0;i<n;i++)cout<<a[i]<<” “;
return 0;
}