Quicksort taking random pivot

partition(arr[], lo, hi) 
    pivot = arr[hi]
    i = lo     // place for swapping
    for j := lo to hi – 1 do
        if arr[j] <= pivot then
            swap arr[i] with arr[j]
            i = i + 1
    swap arr[i] with arr[hi]
    return i

partition_r(arr[], lo, hi)
    r = Random Number from lo to hi
    Swap arr[r] and arr[hi]
    return partition(arr, lo, hi)

quicksort(arr[], lo, hi)
    if lo < hi
        p = partition_r(arr, lo, hi)
        quicksort(arr, lo , p-1)
        quicksort(arr, p+1, hi)

Source: geeksforgeeks.org

Similar codes

4 votes145 views2 answers
Input pdf latex
C++
0 vote138 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
117 votes297 views10 answers
Wattpad
C++
0 vote161 views1 answer
Make an x using asterisk c++
C++
0 vote170 views1 answer
Check if equal to \ char or not c++
C++
1 vote146 views1 answer
What are specialized classes c++
C++
0 vote179 views1 answer
Compile in c++
C++
2 votes148 views2 answers
Onclick show hide div jquery demo
C++
3 votes133 views2 answers
C++ vector element search
C++
1 vote139 views1 answer
Cmake define standard c++
C++