Function sorts::insertion_sort::insertion_sort

pub fn insertion_sort<T: PartialOrd>(s: &mut [T])

Sorts a slice in-place using insertion sort.

This sorting algorithm is very efficient when used on small data sets. This is because insertion sort has constant space complexity and works very fast when used on partially sorted data.

Examples

let mut vec = vec![-4, -5, 7, 45, 0];
sorts::insertion_sort(&mut vec);
assert_eq!(vec, &[-5, -4, 0, 7, 45]);