Function comp_sci::algorithms::selection_sort::selection_sort

pub fn selection_sort<'a, A: Ord + 'a>(data: &'a mut [A])

Efficient sorting against small sets.

Selection sort is inefficient against large sets. It requires no additional memory.

The write performance of O(n) is better than that of e.g. insertion sort's O(n^2).