data-structures-algorithms 1.0.0

Data Structures and Algorithms in Rust!
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79

#[cfg(test)]
mod sorting_test {
    use crate::algorithms::sorting::*;
    use crate::data_structures::heap::Heap;

    #[test]
    fn test_bubble_sort() {
        let mut arr = [66, 18, 54, 67, 36, 44, 78, 18, 12, 56];
        bubble_sort(&mut arr);
        let expected = [12, 18, 18, 36, 44, 54, 56, 66, 67, 78];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_insertion_sort() {
        let mut arr = [66, 18, 54, 67, 36, 44, 78, 18, 12, 56];
        insertion_sort(&mut arr);
        let expected = [12, 18, 18, 36, 44, 54, 56, 66, 67, 78];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_selection_sort() {
        let mut arr = [66, 18, 54, 67, 36, 44, 78, 18, 12, 56];
        selection_sort(&mut arr);
        let expected = [12, 18, 18, 36, 44, 54, 56, 66, 67, 78];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_merge_sort() {
        let mut arr = [66, 18, 54, 67, 36, 44, 78, 18, 12, 56];
        merge_sort(&mut arr);
        let expected = [12, 18, 18, 36, 44, 54, 56, 66, 67, 78];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_quick_sort() {
        let mut arr = [66, 18, 54, 67, 36, 44, 78, 18, 12, 56];
        quick_sort(&mut arr);
        let expected = [12, 18, 18, 36, 44, 54, 56, 66, 67, 78];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_counting_sort() {
        let mut arr = [2, 5, 3, 0, 2, 3, 0, 3];
        counting_sort(&mut arr);
        let expected = [0, 0, 2, 2, 3, 3, 3, 5];

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_radix_sort() {
        let mut arr = [2, 5, 3, 0, 2, 3, 0, 3];
        radix_sort(&mut arr);
        let expected = [0, 0, 2, 2, 3, 3, 3, 5]; 

        assert_eq!(arr, expected);
    }
    #[test]
    fn test_heap_sort_max_heap() {
        let mut heap = Heap::new(true); // Max-heap
        heap.values = vec![3, 1, 6, 5, 2, 4];
        heap_sort(&mut heap);

        assert_eq!(heap.values, vec![1, 2, 3, 4, 5, 6]);
    }

    #[test]
    fn test_heap_sort_min_heap() {
        let mut heap = Heap::new(false); // Min-heap
        heap.values = vec![3, 1, 6, 5, 2, 4];
        heap_sort(&mut heap);

        assert_eq!(heap.values, vec![6, 5, 4, 3, 2, 1]);
    }
}