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

-3 votes177 views3 answers
Open a url with dev c
C++
0 vote177 views1 answer
How to get a section of a string in c++
C++
1 vote191 views2 answers
Scope resolution operator in c++
C++
4 votes196 views1 answer
Gcd of two numbers c++
C++
0 vote182 views1 answer
Two D Arrays
C++
3 votes180 views4 answers
String c++
C++
7 votes157 views1 answer
How to make string get spaces c++
C++
-1 vote184 views1 answer
How to declare a function in c++ header file
C++
26 votes213 views1 answer
Delete specific vector element c++
C++
0 vote169 views1 answer
Dfs program in c++
C++