pub fn insertion_sort<T>(container: &mut T, range: Range<usize>)where T: Sortable + ?Sized,
sort the container in the specified range using the insertion sort algorithm