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 vote255 views1 answer
C++ client service ros
C++
0 vote269 views1 answer
Disallowcopy c++
C++
0 vote259 views1 answer
Temporary mobile number
C++
0 vote231 views1 answer
Compilling c++ and c by console
C++
0 vote265 views1 answer
Give an algorithm for finding the ith-to-last node in a singly linked list in which the last node is indicated by a null next reference.
C++
2 votes255 views1 answer
For loop reverse C++
C++
0 vote228 views1 answer
C for loop decrement
C++
0 vote255 views1 answer
2d stl array
C++
0 vote247 views1 answer
Swap of two numbers in c++
C++
0 vote264 views1 answer
Pass map as reference c++
C++