pub fn min_unstable<T: Ord>(v: &mut [T], n: usize) -> &mut [T]
Returns the n
smallest items.
This sort is unstable (i.e. may reorder equal elements), in-place
(i.e. does not allocate), and typically faster than min
.
Panics if n > len
.
let mut v = [-5, 4, 1, -3, 2];
let min = out::slice::min_unstable(&mut v, 3);
assert_eq!(min, [1, -3, -5]);