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 vote323 views1 answer
How to block the screen c++
C++
0 vote333 views1 answer
Vector of strings initialization c++
C++
0 vote348 views4 answers
Define for loop c++
C++
0 vote320 views1 answer
Patterns in c++
C++
1 vote350 views1 answer
How to read a line from the console in c++
C++
1 vote296 views1 answer
Std string to wstring
C++
0 vote347 views1 answer
Simple C++ game code
C++
0 vote285 views1 answer
\frac{2}{5}MR^2 typed in c++
C++
-2 votes297 views6 answers
Array in c++
C++
10 votes546 views6 answers
C to c++ converter online
C++