#include<iostream>

using namespace std;

void quicksort(int a[],int left,int right){
int i,j,pivot,temp=0;
if(left<right){
pivot=left;
i=left+1;
j=right;
for(;;){
while(a[i]<=pivot)
i++;
while(a[j]>=pivot)
j--;
if(i<j){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
else{
break;
}
}
temp=a[pivot];
a[pivot]=a[j];
a[j]=temp;
quicksort(a,left,j-1);
quicksort(a,j+1,right);
}
}
int main(){
int i,a[20],n;
cout<<"Enter n: ";
cin>>n;
cout<<"Enter array elements: ";
for(i=0;i<n;i++){
cin>>a[i];
}
quicksort(a,0,n-1);
cout<<"Sorted array is: ";
for(i=0;i<n;i++){
cout<<a[i];
}
}