Function pdqsort::sort

pub fn sort<T>(v: &mut [T]) where
    T: Ord, 

Sorts a slice.

This sort is in-place, unstable, and O(n log n) worst-case.

The implementation is based on Orson Peters' pattern-defeating quicksort.

Examples

extern crate pdqsort;

let mut v = [-5, 4, 1, -3, 2];
pdqsort::sort(&mut v);
assert!(v == [-5, -3, 1, 2, 4]);