QuickSort.cpp

#include <iostream>
using namespace std;

int setPivot(int* arr, int l, int r){
    int pivot = (l+r)/2;
    int temp;
    int i = l;
    int j= r;
    while (true){
        while (arr[i] < arr[pivot]){
            i++;
        }
        while (arr[j] > arr[pivot]){
            j--;
        }
        if (i>=j)
        {
            return j;
        }
        temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}
void QuickSort(int* arr, int l, int r){
    int index = setPivot(arr,l,r);
    cout<<"new Pivot after setPivot Function: "<<index<<endl;
    if (l<r){
        cout<<"Right: "<<r<<" Left: "<<l<<endl;
        QuickSort(arr,l,index);
        QuickSort(arr,index+1,r);
    }
    
}
int main(){
    int arr[10] = {78,92,55,62,77,97,11,52,88,29};
    QuickSort(arr,0,9);
    for (size_t i = 0; i < sizeof(arr)/sizeof(int); i++){
        cout<<arr[i]<<" ";
    }
    return 0;
}