Fig. 2 - Quick Let arr be an array with n elements.
quickSort(arr[], low, high) {
if (low < high) {
pivot_index = partition(arr, low, high);
quickSort(arr, low, pivot_index - 1);
quickSort(arr, pivot_index + 1, high);
}
}
partition (arr[], low, high) {
pivot = arr[high];
i = (low - 1);
for (j = low; j <= high-1; j++) {
if (arr[j] < pivot) {
i++;
swap(arr[i], arr[j]);
}
}
swap(arr[i + 1], arr[high]);
return (i + 1);
}