QuickSort.cpp

#include<iostream>
#include<vector>
using namespace std;

int partition(vector<int>&arr,int st,int end){

    int idx=st-1;
    int pivot=arr[end];

    for(int j=st;j<end;j++){

        if(arr[j]<=pivot){
            idx++;
            swap(arr[j],arr[idx]);
        }
    }
    idx++;
   swap(arr[idx],arr[end]);

    return idx;
}


void  QuickSort(vector<int>&arr,int st,int end){
if(st<end){


    int pividx= partition(arr,st,end);

    //the call for left half
     QuickSort(arr,st,pividx-1);
 
     //the call for right half
 
     QuickSort(arr,pividx+1,end);





}
}


int main(){

    vector<int> arr ={12,31,35,8,32,17};

    QuickSort(arr,0,arr.size()-1);

    for(int val: arr){
        cout<<val<<" ";
    }

    return 0;
}