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 vote150 views3 answers
11
C++
1 vote119 views2 answers
Insert vector to end of vector c++
C++
0 vote121 views1 answer
C++ linker input and output
C++
0 vote130 views1 answer
How to install opencv c++ on windows vscode
C++
1 vote106 views1 answer
How to traverse a linked list in c++
C++
2 votes125 views1 answer
Print a string with printf in c++
C++
0 vote117 views1 answer
The five most significant revisions of the C++ standard are C++98 (1998), C++03 (2003) and C++11 (2011), C++14 (2014) and C++17 (2017)
C++
-1 vote124 views1 answer
Pointer to constant
C++
1 vote115 views1 answer
C++ print vector without loop
C++
5 votes133 views4 answers
Pointers in c++
C++