quickSort

#include<stdio.h>

void swap_(int *a, int *b){
    int temp = *a;
    *a = *b;
    *b = temp;
}

int partiTion(int arr[], int left, int right){
    int pivot = arr[right];
    int i = left-1;

    for(int j = left; j < right; j++){
        if(arr[j] < pivot){
            i++;
            swap_(&arr[i], &arr[j]);
        }
    }

    swap_(&arr[i+1], &arr[right]);

    return (i+1);
}


void quickSort(int arr[], int left, int right){
    if(left < right){
        int pIndex = partiTion(arr, left, right);
        quickSort(arr, left, pIndex-1);
        quickSort(arr, pIndex+1, right);
    }
}

void Print(int arr[], int n){
    for(int i = 0; i < n; i++){
        printf("%d ", arr[i]);
    }
    printf("\n");
}

int main(){
    int arr[10] = {5,6,2,8,7,1,9,3};
    int n = 8;

    quickSort(arr, 0, n-1);

    //Print(arr, n);

    return 0;

}