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

30 votes301 views2 answers
Integer range in c++
C++
0 vote310 views1 answer
SFML texture from file max size
C++
0 vote302 views1 answer
Assegnare valori in c++
C++
0 vote292 views1 answer
How to print items in c++
C++
0 vote306 views1 answer
Cout hex c++
C++
2 votes299 views1 answer
C++ print current time
C++
0 vote298 views1 answer
Vector of int to string c++
C++
4 votes291 views2 answers
Sqrt cpp
C++
0 vote290 views1 answer
The iostream is the head er file which contains all the functions of program like cout, cin and etc.
C++
0 vote308 views1 answer
Dynamic memory in c++
C++