QuickSort-Lomuto's Version

LomutoQuickSort.c

void swap(int *a, int *b){
    int tmp;
    tmp = *a;
    *a = *b;
    *b = tmp;
}

void quickSort(int left, int right, int *arr){
    // base
    if(left>=right)
        return;

    int i, j;
    int pivot, tmp;
    pivot = arr[right];
    i = left;
    while(i<right&&arr[i]<pivot)
        i++;

    j = i+1;
    while(j<right){
        if(arr[j]<pivot){
            swap(arr+j, arr+i);
            i++;
        }
        j++;
    }
    swap(arr+i, arr+right);

    // sort left and right part
    quickSort(left, i-1, arr);
    quickSort(i+1, right, arr);
}