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 vote188 views1 answer
Define unicode c++
C++
0 vote168 views1 answer
C++ Greatest common divisor
C++
1 vote175 views1 answer
What is the meaning of life and everything in the universe
C++
6 votes176 views1 answer
How to initialize array with new in c++
C++
1 vote188 views1 answer
How to create a struct in c++
C++
0 vote184 views1 answer
Decimal to binary gfg
C++
0 vote172 views1 answer
Binpow in fenwick tree
C++
1 vote158 views1 answer
Delete a head node in link list
C++
0 vote157 views1 answer
Ordine crescente "senza" vettori in c++
C++
8 votes170 views3 answers
Initialize all elements of vector to 0 c++
C++