Median
Efficient computation of the sample median

Selection algorithms still have the downside of requiring Ω(n) memory, that is, they need to have the full sample (or a linear-sized portion of it) in memory. Because this, as well as the linear time requirement, can be prohibitive, several estimation procedures for the median have been developed. A simple one is the median of three rule, which estimates the median as the median of a three-element subsample; this is commonly used as a subroutine in the quicksort sorting algorithm, which uses an estimate of its input's median. A more robust estimator is Tukey 's ninther, which is the median of three rule applied with limited recursion: if A is the sample laid out as an array, and
detectable_format:json_format, oulipo:avoid_letter[e]