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 vote138 views1 answer
Chess perft 5
C++
0 vote133 views1 answer
C++ code 2d block
C++
2 votes157 views1 answer
MPI_file_open
C++
1 vote151 views1 answer
Multithreading in c++
C++
0 vote127 views1 answer
Sfml thread multi argument function
C++
-1 vote137 views1 answer
How to append two vectors in c++
C++
1 vote134 views2 answers
C++ get type name
C++
10 votes124 views2 answers
Check if character in string c++
C++
0 vote148 views1 answer
Function to calculate compound interest in C++
C++
8 votes126 views2 answers
Cpp print vector
C++