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 vote246 views1 answer
C++ allocate and free dynamic 2d array
C++
3 votes208 views1 answer
C++ how to make a negative float positive
C++
5 votes202 views2 answers
Sleep c++ windows
C++
0 vote252 views1 answer
Iterating in map/unordered map c++
C++
0 vote237 views1 answer
Qrandomgenerator bounded
C++
0 vote201 views3 answers
Bool function in c++
C++
0 vote212 views2 answers
C++ function for checking if a sting is a number
C++
1 vote213 views3 answers
If else c++
C++
2 votes202 views1 answer
Sfml draw tex
C++
2 votes195 views1 answer
C++ check first character of string
C++