interactive_quick_sort.cpp

#include <string>
#include<iostream>
using namespace std;  
void swap(int* a, int* b) 
{ 
    int temp = *a; 
    *a = *b; 
    *b = temp; 
} 
int partition(int arr[], int l, int h) 
{ 
    int x = arr[h]; 
    int i = (l - 1); 
  
    for (int j = l; j <= h - 1; j++) { 
        if (arr[j] <= x) { 
            i++; 
            swap(&arr[i], &arr[j]); 
        } 
    } 
    swap(&arr[i + 1], &arr[h]); 
    return (i + 1); 
} 
void quickSort(int A[], int l, int h) 
{ 
    if (l < h) { 
        /* Partitioning index */
        int p = partition(A, l, h); 
        quickSort(A, l, p - 1); 
        quickSort(A, p + 1, h); 
    } 
} 
int main() 
{   
    int n = 5; 
    int arr[n] = { 4, 2, 6, 9, 2 }; 
  
    quickSort(arr, 0, n - 1); 
  
    for (int i = 0; i < n; i++) { 
        cout << arr[i] << " "; 
    }   
    return 0; 
}