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 vote244 views1 answer
C++ round number up
C++
3 votes246 views2 answers
All of the stars lyrics
C++
40 votes336 views6 answers
Hello world in cpp
C++
7 votes252 views6 answers
Sleep in c++
C++
14 votes259 views1 answer
Array 2d dynamic allocation c++
C++
0 vote254 views1 answer
Bash find into array
C++
1 vote261 views1 answer
How to specify how many decimal to print out with std::cout
C++
-1 vote276 views1 answer
How to write hello world c++
C++
2 votes273 views1 answer
++x vs x++
C++
0 vote243 views1 answer
C++ exam
C++