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

1 vote187 views1 answer
C++ uniform_real_distribution get same result
C++
4 votes111 views2 answers
C++ initialize a vector
C++
1 vote111 views1 answer
64 bit unsigned integer c++
C++
0 vote115 views7 answers
C code to mips assembly converter online
C++
0 vote120 views1 answer
All permutations with repetition C++
C++
1 vote108 views1 answer
How to add colored text in c++
C++
0 vote117 views1 answer
C++ print binary treenode
C++
3 votes130 views2 answers
Infinity c++
C++
0 vote112 views1 answer
Use ster when declaring variables cpp
C++
20 votes112 views5 answers
File c++
C++