Function randPartition

CPP/sorting/intro_sort.cpp:62–72

Quicksort randomized partition to rearrange elements across pivot

 
// Quicksort randomized partition to rearrange elements across pivot
int randPartition(int a[], int low, int high)
{
    // choose a random index between `[low, high]`
    int pivotIndex = rand() % (high - low + 1) + low;
 
    // swap the end element with the element present at a random index
    swap(a[pivotIndex], a[high]);
 
    // call the partition procedure
    return partition(a, low, high);
}
 
// Function to perform heapsort on the given range of elements
void heapsort(int *begin, int *end)