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 vote431 views1 answer
Changing values of mat in opencv c++
C++
2 votes271 views2 answers
Count bits c++
C++
-1 vote299 views2 answers
Open url from dev cpp
C++
3 votes292 views3 answers
Quick sort c++
C++
0 vote275 views1 answer
How to move your chrector in unity
C++
0 vote270 views1 answer
How to refresh multiple command lines in C++ stream
C++
0 vote311 views1 answer
Stl reverse sort a array
C++
1 vote299 views1 answer
How to print in new lines in C++
C++
-2 votes322 views4 answers
Function Template in c++
C++
0 vote312 views1 answer
Assignment operator with pointers c++
C++