Function extra::sort::merge_sort

pub fn merge_sort<T: std::clone::Clone>(v: &[T], le: Le<T>) -> ~[T]

Merge sort. Returns a new vector containing the sorted list.

Has worst case O(n log n) performance, best case O(n), but is not space efficient. This is a stable sort.