Returns k-th smallest element of an array, i.e. its order statistics. Time complexity is O(n^2) in the worst case, but only O(n) on average. It mutates the input, and therefore does not require additional space.
(input: &mut [T], k: usize)
source not stored for this graph (policy: none)