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 votes166 views5 answers
C++ loop through array
C++
0 vote196 views1 answer
My cpp
C++
0 vote230 views5 answers
Return tuple or null
C++
1 vote160 views1 answer
Google spreadsheets add two strings
C++
0 vote149 views3 answers
Mm
C++
17 votes175 views4 answers
Max element in vector c++
C++
0 vote161 views1 answer
Cpp tutorial
C++
0 vote197 views1 answer
Is palindrom
C++
5 votes147 views2 answers
Best way to take input in cpp
C++
0 vote112 views1 answer
How to print hex of char c++
C++