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

4 votes229 views2 answers
Sqrt cpp
C++
0 vote253 views1 answer
Ex: java script
C++
0 vote257 views2 answers
C++ 14 for sublime windoes build system
C++
0 vote226 views1 answer
Char size length c++
C++
0 vote236 views1 answer
Ue4 int to enum c++
C++
0 vote249 views1 answer
Log base 2 in c++
C++
1 vote247 views1 answer
Joining two vectors in c++
C++
0 vote216 views1 answer
Kadane algo
C++
3 votes233 views2 answers
Maximum int c++
C++
0 vote246 views1 answer
1162261467
C++