Function sort_steps::insertion_sort_by

pub fn insertion_sort_by<T, F>(
    v: &[T],
    compare: F
) -> impl Iterator<Item = Vec<T>>where
    F: Fn(&T, &T) -> Option<Ordering> + Copy,
    T: Clone,

Sorts a slice of data using the insertion sort algorithm with a custom comparator.

Examples

let numbers = [5, 9, 3, 6, 8, 2, 1, 7, 4];
println!("Heap Sort Steps:");
for (i, v) in insertion_sort_by(&numbers, |a, b| a.partial_cmp(b)).enumerate() {
    println!("#{:02}: {:?}", i, v);
}