pub fn quick_sort3<T: std::clone::Clone + std::cmp::Ord + std::cmp::Eq>(arr: &mut [T])
Fancy quicksort. Sorts a mut vector in place.
Based on algorithm presented by ~Sedgewick and Bentley. According to these slides this is the algorithm of choice for 'randomly ordered keys, abstract compare' & 'small number of key values'.
This is an unstable sort.
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct (or str), enum,
trait, typedef (or
tdef).