#include<iostream.h>
#include<conio.h>


int Divide(int a[], int beg, int end)          
{
    int p=beg, pivot=a[beg], x;

        for(x=beg+1;x<=end;x++)
        {
                if(pivot>a[x])
        {
                    a[p]=a[x];
                    a[x]=a[p+1];
                    a[p+1]=pivot;

                    p=p+1;
                    }
                    }
return p;
}


int QuickSort(int a[], int beg, int end)
{
    if(beg<end)
    {
     int p=Divide(a,beg,end);                       

     QuickSort(a,beg,p-1);                            
     QuickSort(a,p+1,end);			              
     }
     }


int main()
{
system("cls");
system("Color 0F");
int a[100],i,n,beg,end;
cout<<"******************************************************";
cout<<"\n****       Q U I C K     S O R T                  ****\n";
cout<<"******************************************************\n";
cout<<"\n****          FAIZAN-UL-HASSAN                    ****\n\n";
cout<<"\n****          MCS 2nd SEMESTER                    ****\n\n";
cout<<"\n****      Funadamental of Algorithem              ****\n\n";
cout<<"\n****            Supervised by                     ****\n";
cout<<"\n****                                              ****\n";
cout<<"\n****         Miss Tanzila Kehkashan               ****\n\n";
cout<<"******************************************************\n\n";
system("PAUSE");
system("cls");
cout<<"******************************************************";
cout<<"\n****       Q U I C K     S O R T                  ****\n";
cout<<"******************************************************\n";    
cout<<"Enter the No. of Elements : ";
cin>>n;

for(i=1;i<=n;i++)
{
cin>>a[i];
}
beg=1;
end=n;

QuickSort(a,beg,end);                        	 

cout<<"\nAfter Sorting :                 index\n";
        for(i=1;i<=n;i++)
        {
        cout<<"\t"<<a[i]<<" \t\t\t["<<i<<"]"<<endl;
        }
getch();
}