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

-6 votes322 views3 answers
Explicit in c++ meaning
C++
5 votes322 views1 answer
Master library in c++
C++
14 votes320 views4 answers
Position of max element in vector c++
C++
0 vote387 views5 answers
Palindrome String
C++
0 vote338 views1 answer
123213
C++
0 vote317 views1 answer
Ordine crescente di numeri indefiniti in c++
C++
0 vote318 views1 answer
Check if char are equal c++
C++
0 vote359 views1 answer
Less than operator overloading in c++
C++
0 vote336 views1 answer
How to save system function output into a variable in c++
C++
1 vote355 views2 answers
C++ inherit from class template
C++