Function double_sort::double_heap_sort

pub fn double_heap_sort<T: Copy + Ord>(array: &mut Vec<T>)

Works in the same way that double_sort does but utilizes BinaryHeaps. This provides a faster but less logarithmic sort since it only shaves half heap.pop() runs.

Note

This was the previous double_sort in 1.0.0

Example

use double_sort::double_heap_sort;
 
fn main() {
    let mut vector = vec![48,23,78,67,89,22,33,44];
  
    double_heap_sort(&mut vector);
 
    assert_eq!(vector,[22,23,33,44,48,67,78,89]);
}