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

5 votes136 views1 answer
#include<bits/stdc++.h>
C++
0 vote148 views1 answer
Check if a string is a prefix of another c++
C++
5 votes185 views3 answers
Fast io c++
C++
0 vote136 views1 answer
Check if a variable is tring c++
C++
0 vote197 views1 answer
String to decimal c++ strtol
C++
1 vote173 views1 answer
Default access specifier in c++
C++
36 votes174 views3 answers
How to type hello world in c++
C++
1 vote147 views1 answer
Union of two arrays leetcode
C++
0 vote162 views2 answers
C++ program to find prime number using function
C++
0 vote151 views2 answers
Opencv combine video
C++