Write a Program of Quick Sorting Algorithm in C++.

QUICK SORT

#include<stdio.h>

#include<conio.h>

#include<iostream>

using namespace std;

int partition(int a[],int p, int r)

{          

            int x,i,j,temp;

            x=a[r];

            i=p-1;

            for(j=p;j<=r-1;j++)

            {          

                        if(a[j]<=x)

                        {          

                                    i++;

                                    temp=a[i];

                                    a[i]=a[j];

                                    a[j]=temp;

                        }

            }

            temp=a[i+1];

            a[i+1]=x;

            a[r]=temp;

            return i+1;

}

void quick_sort(int a[],int n,int p,int r)

{          

            if(p<r)

            {

                        int q=partition(a,p,r);

                        quick_sort(a,n,p,q-1);

                        quick_sort(a,n,q+1,r);

            }

}

int main()

{

            int n,i;

            cout<<"\nEnter Value of N:";

            cin>>n;

            int a[n];

            cout<<"\nEnter Array Element:"<<endl;

            for(i=0;i<n;i++)

            {          

                        cin>>a[i];

                        quick_sort(a,n,0,n-1);

            }

            cout<<endl<<"Sort Array:";

            for(int p=0;p<n;p++)

            {          

                        cout<<endl<<a[p];

            }

            return 0;

            getch();

}

OUTPUT