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 vote171 views1 answer
Have unique vector after sorting vector
C++
0 vote165 views1 answer
What is imposter syndrome
C++
13 votes180 views3 answers
? in cpp
C++
10 votes128 views2 answers
Last index of string c++
C++
0 vote169 views1 answer
Auto keyword
C++
0 vote186 views1 answer
C++ set element at index
C++
-1 vote131 views1 answer
C++ to mips assembly converter
C++
0 vote199 views1 answer
Hpp files
C++
12 votes199 views4 answers
How to initialized a 2d vector
C++
39 votes181 views6 answers
How to Add to an Array
C++