Breaking News: Grepper is joining You.com. Read the official announcement!

randomize quick sort

Vo Dang Trinh answered on December 23, 2022 Popularity 8/10 Helpfulness 4/10

answer randomize quick sort

randomize quick sort

Comment

// A randomized partition routine
int randomizedPartition(int arr[], int start, int end)
{
    // choose a random index between `start` and `end`
    int pivotIndex = rand() % (end - start + 1) + start;
 
    // swap the end element with the element present at random index
    swap(arr[pivotIndex], arr[end]);
 
    // call partition procedure
    return partition(arr, start, end);
}
 
// Quicksort using the randomized partition
void quicksort(int arr[] ,int start, int end)
{
    // base condition
    if (start >= end) {
        return;
    }
 
    // rearrange the elements across the pivot
    int pivot = randomizedPartition(arr, start, end);
 
    // recur on subarray containing elements that are less than the pivot
    quicksort(arr, start, pivot - 1);
 
    // recur on subarray containing elements that are more than the pivot
    quicksort(arr, pivot + 1, end);
}

Popularity 8/10 Helpfulness 4/10 Language cpp

Source: www.techiedelight.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Dec 23 2022

Vo Dang Trinh

0 Answers Avg Quality 2/10

randomize quick sort

Contents

More Related Answers

randomize quick sort

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.