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 vote321 views1 answer
Print number with leading zeros
C++
0 vote310 views1 answer
SET TO NULL pointer c++
C++
1 vote314 views1 answer
C++ find in pair
C++
1 vote352 views1 answer
How to get a letter from the users string in c++
C++
0 vote318 views1 answer
Iterate over 2 vectors c++
C++
2 votes290 views1 answer
Dangling Pointer
C++
8 votes402 views10 answers
Javascript loop array
C++
1 vote330 views1 answer
C++ 20 struct initialization
C++
0 vote317 views1 answer
Decising how many numbers after comma c++
C++
3 votes323 views3 answers
C++ class
C++