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

0 vote128 views1 answer
Add two constant char pointers c++
C++
0 vote115 views1 answer
C++ triangle
C++
1 vote131 views1 answer
Print 5 table in c++
C++
3 votes153 views1 answer
What language was c+ written in
C++
-1 vote119 views1 answer
Assigning a seed on a random number generator in C++
C++
72 votes172 views4 answers
C++ vector pop first element
C++
0 vote132 views1 answer
Character array to string c++ stl
C++
1 vote134 views1 answer
How to print in new lines in C++
C++
0 vote120 views1 answer
Balanced brackets hackerrank solution c++
C++
2 votes139 views1 answer
Null c++
C++