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

1 vote327 views1 answer
Modulo Exponentiaon,Iteratve Modulo Exponentiation
C++
0 vote344 views1 answer
Fstream read write mode
C++
0 vote336 views1 answer
C++ generate a random letter
C++
0 vote326 views1 answer
Strcmp in c++ header file
C++
0 vote317 views1 answer
Binary search c++
C++
0 vote377 views1 answer
Three way comparison operator c++
C++
1 vote279 views1 answer
How to set environment variable for c++
C++
0 vote306 views1 answer
Person parametr cpp
C++
0 vote343 views1 answer
Cpp print variable value
C++
3 votes350 views3 answers
Find an element in vector of pair c++
C++