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 vote187 views1 answer
C++ print unsigned long
C++
0 vote193 views1 answer
Hola mundo c++
C++
13 votes196 views3 answers
Python remove repeated characters from string
C++
0 vote208 views1 answer
A variable with 2 independant variables plot
C++
0 vote214 views1 answer
C++ lettura file
C++
0 vote237 views2 answers
Dynamic memory allocation c++
C++
3 votes188 views2 answers
Convert long int to binary string c++
C++
0 vote208 views1 answer
ImportError: cannot import name 'TFLiteConverter' from 'tensorflow.lite'
C++
0 vote220 views1 answer
Check if float has decimals c++
C++
0 vote203 views1 answer
Print number with leading zeros
C++