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

4 votes130 views1 answer
Deep copy c++
C++
0 vote119 views1 answer
Mt19937 example c++
C++
7 votes129 views2 answers
How to concatenate vectors in c++
C++
0 vote112 views2 answers
Generating unique id for an object in c++
C++
0 vote106 views1 answer
The amount of input is unknown
C++
0 vote117 views1 answer
Error: ‘memset’ was not declared in this scope in cpp
C++
0 vote115 views1 answer
C++ enum rand
C++
0 vote126 views1 answer
How to format decimal palces in c++
C++
1 vote109 views1 answer
G++ -wall option meaning
C++
0 vote108 views1 answer
Cudamemcpy
C++