# Program for Quick Sort in C++ Array

Quick Sort is one of the most efficient sorting algorithms whose best, worst and average-case time complexities are O (n log n), O (n2) and O (n log n) respectively.

There are many different versions of quickSort that pick pivot in different ways.

1= Always pick the first element as pivot.
2= Always pick the last element as the pivot (implemented below)
3= Pick a random element as pivot.
4= Pick median as the pivot.

## Program for Quick Sort in C++ Array

``````#include <iostream>
using namespace std;
void quick_sort(int[],int,int);
int partition(int[],int,int);
int main()
{
int a[50],n,i;
cout<<"How many elements?";
cin>>n;
cout<<"\nEnter array elements:";
for(i=0;i<n;i++)
cin>>a[i];
quick_sort(a,0,n-1);
cout<<"\nArray after sorting:";
for(i=0;i<n;i++)
cout<<a[i]<<" ";
return 0;
}
void quick_sort(int a[],int l,int u)
{
int j;
if(l<u)
{
j=partition(a,l,u);
quick_sort(a,l,j-1);
quick_sort(a,j+1,u);
}
}
int partition(int a[],int l,int u)
{
int v,i,j,temp;
v=a[l];
i=l;
j=u+1;
do
{
do
i++;
while(a[i]<v&&i<=u);
do
j--;
while(v<a[j]);
if(i<j)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}while(i<j);
a[l]=a[j];
a[j]=v;
return(j);
}``````

Output of Program

How many elements?6

Enter array elements:87
80
12
32
25
45

Array after sorting:12 25 32 45 80 87

Categories C++