algods 0.1.0

A collection of data structures and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#[cfg(test)]
mod tests {
    use super::super::{BinaryHeapSort, HeapSort};
    use crate::utils::{gen_vec_rand_int, RandKind};

    #[test]
    fn test_heap_sort() {
        let mut vec = gen_vec_rand_int(100000, RandKind::Full);
        let h = HeapSort::init(vec.clone());
        let v = h.into_sorted_vec();
        vec.sort();
        assert_eq!(vec, v);
    }

    #[test]
    fn test_binary_heap_sort() {
        let mut vec = gen_vec_rand_int(100000, RandKind::Full);
        let h = BinaryHeapSort::init(vec.clone());
        let v = h.into_sorted_vec();
        vec.sort();
        assert_eq!(vec, v);
    }
}