Function sort_steps::heap_sort

pub fn heap_sort<T>(v: &[T]) -> impl Iterator<Item = Vec<T>>where
    T: PartialOrd + Clone,

Sorts a slice of data using the heap 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 heap_sort(&numbers).enumerate() {
    println!("#{:02}: {:?}", i, v);
}