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

2 votes241 views1 answer
C++ string to integer without stoi
C++
0 vote182 views1 answer
Fast i/o in c++
C++
20 votes157 views10 answers
Prime number c++
C++
0 vote199 views1 answer
Request for member ‘push_back’ in ‘matrix’, which is of non-class type ‘std::vector<int>()’
C++
0 vote188 views1 answer
Delete heap array c
C++
-1 vote176 views1 answer
Assigning a seed on a random number generator in C++
C++
0 vote193 views2 answers
Iostream c++
C++
0 vote187 views1 answer
C++ write to file in directory
C++
0 vote189 views3 answers
Dynamic memory c++
C++
0 vote200 views1 answer
C++ enum rand
C++