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

0 vote304 views1 answer
C++c
C++
0 vote249 views2 answers
Cplusplusbtutotrail
C++
19 votes287 views3 answers
Segmentation fault (core dumped)
C++
0 vote297 views1 answer
What does npl mean?
C++
0 vote269 views1 answer
How to get the last element of an array in C++ using std::array
C++
7 votes285 views3 answers
Length of 2d array c++
C++
3 votes273 views3 answers
Error handling in C++
C++
41 votes338 views6 answers
Print hello world c++
C++
29 votes357 views6 answers
Convert string to number c++
C++
2 votes295 views1 answer
How to use python sleep function on c++
C++