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 votes279 views2 answers
Vbs check if file exists
C++
0 vote258 views1 answer
C++ program to convert kelvin to celsius
C++
1 vote258 views2 answers
Length of number c++
C++
1 vote327 views3 answers
Minimum characters to make string palindrome
C++
-2 votes260 views2 answers
C++ random float
C++
2 votes284 views1 answer
Hwo to calculate the number of digits using log in c++
C++
104 votes386 views6 answers
Convert int to string c++
C++
-2 votes284 views4 answers
Memset function in C++
C++
1 vote282 views1 answer
C++ sqlite open file in other directory
C++
18 votes279 views4 answers
Length of array in cpp
C++