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

1 vote148 views1 answer
Chess perft 5
C++
9 votes190 views2 answers
Sort vector in reverse order c++
C++
0 vote141 views1 answer
Is there garbage collection in c++
C++
2 votes171 views1 answer
C++ string to integer without stoi
C++
8 votes142 views3 answers
C++ check substring
C++
1 vote150 views1 answer
How to return 2d array from function c++
C++
2 votes110 views1 answer
Qstring mid
C++
-2 votes166 views6 answers
C++ array
C++
3 votes148 views2 answers
Iomanip
C++
2 votes154 views2 answers
C++ in cmd
C++