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 vote224 views1 answer
Opencv c++ feature detection
C++
0 vote209 views1 answer
Split text c++
C++
1 vote170 views1 answer
Vector library c++
C++
0 vote197 views1 answer
How to make a c++ iostream program restart when finished
C++
0 vote206 views1 answer
Imports the elements in the array c++
C++
1 vote152 views1 answer
Random number between x and y c++
C++
12 votes184 views3 answers
C++ max of array
C++
23 votes232 views2 answers
What is c++ function
C++
0 vote194 views1 answer
Std::set remove item
C++
2 votes194 views2 answers
Random number generator c++ between 0 and 1
C++