include[HTML_REMOVED]

int main(){
int n;
scanf(“%d”,&n);
int a[n];
int i;
for(i=0;i[HTML_REMOVED]=r) return;
int i=l-1,j=r+1;
int mid=a[(l+r)/2];
while(i[HTML_REMOVED]mid) ;
if(i<j){
int t=a[i];
a[i]=a[j];
a[j]=t;
}
}
quicksort(a,l,j);
quicksort(a,j+1,r);
}