#include<iostream.h>
#include<conio.h>
int a[10],l,u,i,j;
void quick(int *,int,int);
void main()
{
clrscr();
cout <<"enter 10 elements";
for(i=0;i<10;i++)
cin >> a[i];
l=0;
u=9;
quick(a,l,u);
cout <<"sorted elements";
for(i=0;i<10;i++)
cout << a[i] << " ";
getch();
}
 
void quick(int a[],int l,int u)
{
   int p,temp;
   if(l<u)
   {
   p=a[l];
   i=l;
   j=u;
    while(i<j)
   {
      while(a[i] <= p && i<j )
	 i++;
      while(a[j]>p && i<=j )
	   j--;
      if(i<=j)
      {
      temp=a[i];
      a[i]=a[j];
      a[j]=temp;}
  }
  temp=a[j];
  a[j]=a[l];
  a[l]=temp;
  cout <<"\n";
  for(i=0;i<10;i++)
  cout <<a[i]<<" ";
  quick(a,l,j-1);
  quick(a,j+1,u);
 }
}

OUTPUT

enter 10 elements5 2 3 16 25 1 20 7 8 61 14
 1 2 3 5 25 16 20 7 8 61
 1 2 3 5 25 16 20 7 8 61
 1 2 3 5 25 16 20 7 8 61
 1 2 3 5 25 16 20 7 8 61

 1 2 3 5 25 16 20 7 8 61
 1 2 3 5 8 16 20 7 25 61
 1 2 3 5 7 8 20 16 25 61
 1 2 3 5 7 8 16 20 25 61
 1 2 3 5 7 8 16 20 25 61
sorted elements1 2 3 5 7 8 16 20 25 61

Not Satisfied ? Just search & get the result