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

2 votes346 views2 answers
Check if directory exists cpp
C++
14 votes298 views3 answers
Initialising 2d vector
C++
1 vote360 views2 answers
How to pause a c++ program.
C++
0 vote329 views1 answer
C++ class constructor variable arguments
C++
0 vote300 views1 answer
Varint index
C++
4 votes322 views1 answer
How to delete a 2d dynamic array in c++
C++
1 vote298 views1 answer
Get handle in C++
C++
0 vote297 views1 answer
Dream speedrun song mp4
C++
0 vote324 views1 answer
Resize method in c++ for arrays
C++
0 vote307 views1 answer
Convert c program to c ++ online
C++