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

5 votes189 views2 answers
Undefined reference to `pthread_create' c++
C++
0 vote194 views1 answer
C++ CHEAT SHEAT
C++
0 vote295 views1 answer
Built in led
C++
0 vote173 views1 answer
Heredar constructor c++
C++
-2 votes231 views1 answer
Sum array c++
C++
0 vote206 views1 answer
Passing a 2d array cpp
C++
-1 vote192 views1 answer
Permutation c++
C++
0 vote223 views1 answer
Two D Arrays
C++
0 vote182 views1 answer
Cuda lock
C++
1 vote190 views1 answer
C++ default array value not null
C++