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 vote101 views1 answer
Cpp how to add collisions to boxes
C++
6 votes103 views2 answers
How to print a decimal number upto 6 places of decimal in c++
C++
-1 vote101 views5 answers
C++ string split
C++
3 votes95 views4 answers
Typedef
C++
0 vote104 views1 answer
Fstring from float c++ ue4
C++
8 votes147 views10 answers
Never gonna give you up
C++
19 votes111 views1 answer
How to output to a file in c++
C++
1 vote110 views1 answer
Ifstream relative file path
C++
0 vote101 views1 answer
Abstraction in cpp
C++
0 vote102 views1 answer
Const in c++ is same as globle in python
C++