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 vote93 views1 answer
Ordine crescente di numeri indefiniti in c++
C++
1 vote90 views1 answer
Detect cycle in an undirected graph
C++
3 votes119 views1 answer
Max three values c++
C++
10 votes97 views3 answers
Initialise 2d vector in c++
C++
2 votes117 views1 answer
C++ lambda thread example
C++
3 votes100 views2 answers
Convert binary string to int c++
C++
0 vote102 views1 answer
Cube mapping sdl
C++
0 vote92 views1 answer
C++ compare time
C++
0 vote100 views2 answers
If else in C++
C++
2 votes97 views3 answers
C++ lambda
C++