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 vote274 views1 answer
Tan ^-1 ti 83
C++
1 vote264 views1 answer
SFML window
C++
-1 vote250 views1 answer
Helloworld in c++
C++
7 votes253 views1 answer
Initialize 2d vector of ints c++
C++
1 vote261 views1 answer
Shared_ptr header file
C++
0 vote248 views1 answer
Graph using queue c++
C++
5 votes346 views1 answer
How to sort a string in c++
C++
1 vote281 views1 answer
Qt qchar to lower
C++
1 vote275 views1 answer
Cpp malloc
C++
0 vote258 views1 answer
How to allocate memory for vector c++
C++