Floyd–Rivest algorithm

Algorithm

The Floyd-Rivest algorithm is a divide and conquer algorithm, sharing many similarities with quickselect. It uses sampling to help partition the list into three sets. It then recursively selects the kth smallest element from the appropriate set.

The general steps are:

1. Select a small random sample S from the list L.
2. From S, recursively select two elements, u and v, such that u < v. These two elements will be the pivots for the partition and are expected to contain the kth smallest element of the entire list between them (in a sorted list).
3. Using u and v, partition S into three sets: A, B, and C. A will contain the elements with values less than u, B will contain the elements with values between u and v, and C will contain the elements with values greater than v.
4. Partition the remaining elements in L (that is, the elements in L - S) by comparing them to u or v and placing them into the appropriate set. If k is smaller than half the number of the elements in L rounded up, then the remaining elements should be compared to v first and then only to u if they are smaller than v. Otherwise, the remaining elements should be compared to u first and only to v if they are greater than u.
5. Based on the value of k, apply the algorithm recursively to the appropriate set to select the kth smallest element in L.

Pseudocode version

The following pseudocode sorts the elements between left and right in ascending order, such that for some value k, where left ≤ k ≤ right, the kth element in the list will contain the (k - left + 1)th smallest value:

// left is the left index for the interval // right is the right index for the interval // k is the desired index value, where array[k] is the (k+1)th smallest element when left = 0 function select(array, left, right, k) while right > left // use select recursively to sample a smaller set of size s // the arbitrary constants 600 and 0.5 are used in the original // version to minimize execution time if right - left > 600 n := right - left + 1 i := k - left + 1 z := ln(n) s := 0.5 * exp(2 * z/3) sd := 0.5 * sqrt(z * s * (n - s)/n) * sign(i - n/2) newLeft = max(left, k - i * s/n + sd) newRight = min(right, k + (n - i) * s/n + sd) select(array, newLeft, newRight, k) // partition the elements between left and right around t t := array[k] i := left j := right swap array[left] and array[k] if array[right] > t swap array[right] and array[left] while i < j swap array[i] and array[j] i := i + 1 j := j - 1 while array[i] < t i := i + 1 while array[j] > t j := j - 1 if array[left] = t swap array[left] and array[j] else j := j + 1 swap array[j] and array[right] // adjust left and right towards the boundaries of the subset // containing the (k - left + 1)th smallest element if j ≤ k left := j + 1 if k ≤ j right := j - 1