How to sort array using quick sort algorithm in c++

Sometimes we are asked to sort an array using specific algorithms like bubble sort or quick sort.Because these algorithms have different space and time complexities.Below quick sort algorithm is used to sort array of ten elements.Structure of this program is easy to understand even for beginners, as this program is created using functions.

First of all user is requested to input 10 elements.These elements will be stored in an array using for-loop.

In next step quick_sort function is called by passing required parameters to it.

The function will then apply quick sort algorithm on provided array, and array will be sorted out in no time.

In final step sorted array will be displayed to the user. 

#include <iostream>
#include <conio.h>
using namespace std;

main()
{
 void quickSort(int[],int,int);
 int a[10],count=0,n;

 cout<<"Ener 10 values in unsorted order : \n";
 for (n=0;n<10;n++)
     {
      cout<<"value no.: "<<(n+1)<<"\t";
      cin>>a[n];
      count++;
     }
 n=0;
 
 quickSort(a,n,count-1);
 
 cout<<"\t\tThe Sorted order is : \n";
 for (n=0;n<10;n++)
     {
      cout<<"\t\tposition : "<<(n+1)<<"\t"<<a[n]<<"\n";
     }
 getch();
}
void quickSort(int arr[], int left, int right) {

      int i = left, j = right;

      int tmp;

      int pivot = arr[(left + right) / 2];

 

      /* partition */

      while (i <= j) {

            while (arr[i] < pivot)

                  i++;

            while (arr[j] > pivot)

                  j--;

            if (i <= j) {

                  tmp = arr[i];

                  arr[i] = arr[j];

                  arr[j] = tmp;

                  i++;

                  j--;

            }

      }

 

      /* recursion */

      if (left < j)

            quickSort(arr, left, j);

      if (i < right)

            quickSort(arr, i, right);

}