Quick_Sort.cpp

class Solution
{
    public:
    //Function to sort an array using quick sort algorithm.
    void quickSort(int arr[], int low, int high)
    {
        if(low>=high){
            return;
        }
        
        int pidx = partition(arr, low, high);
        
        quickSort(arr, low, pidx-1);
        quickSort(arr, pidx+1, high);
        
    }
    
    public:
    int partition (int arr[], int low, int high)
    {
       int pivot = arr[high];
       int pidx = low;
       
       for(int i=low; i<high; i++){
           if(arr[i]<=pivot){
               swap(arr[i], arr[pidx++]);
           }
       }
       swap(arr[pidx], arr[high]);
       
       return pidx;
    }
};