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 vote225 views1 answer
How to rotate canvas android
C++
-6 votes214 views3 answers
Explicit in c++ meaning
C++
0 vote202 views1 answer
MPI_PUT
C++
0 vote220 views1 answer
C++ thread incide class
C++
1 vote253 views1 answer
If not defined c++
C++
3 votes266 views6 answers
C++ for loops
C++
0 vote225 views1 answer
Less than operator overloading in c++
C++
0 vote230 views1 answer
Tuple vector c++
C++
0 vote211 views1 answer
Maximum subarray leetcode c++
C++
2 votes220 views1 answer
C++ wait for user input
C++