Quick sort CODE

#include
#include
#include
int a[20];
class quick
{
int i,j;
public:
void quicksort(int lb,int ub);
};
void quick::quicksort(int lb,int ub)
{
int pivot,temp;
if(lb{
i=lb;
j=ub;
pivot=a[lb];
while(i{
while(a[i]<=pivot)
i++;
while(a[j]>pivot)
j--;
if(i{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
else
break;
}
a[lb]=a[j];
a[j]=pivot;
quicksort(lb,j-1);
quicksort(j+1,ub);
}
}
void main()
{
quick q;
int i,n;
clrscr();
cout<<"enter n values:";
cin>>n;
cout<<"array elements"<for(i=0;icin>>a[i];
q.quicksort(0,n-1);
cout<<"the sorted array\n";
for(i=0;icout<<" "<getch();
}