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 vote175 views1 answer
Qt qstring to double
C++
1 vote125 views3 answers
How to use cout function in c++
C++
1 vote130 views1 answer
Char type casting in c++
C++
0 vote125 views2 answers
Use c++17 g++
C++
37 votes172 views2 answers
Remove element by index from vector c++
C++
0 vote152 views1 answer
Initialize 2d array c++ memset
C++
0 vote130 views1 answer
Check if cin didn't get int
C++
3 votes150 views1 answer
C++ how to make a negative float positive
C++
0 vote145 views3 answers
Get number round off to two decimal places c++
C++
0 vote137 views1 answer
C++ to assembly
C++