sort_algos 0.1.2

Sorting alghoritms
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
80
81

#![allow(unused)]

pub mod sorter;
use sorter::{SortTypes, Sorter};

trait Sort {
    fn sort<T>(ar: &mut [T])
    where
        T: PartialOrd + Copy;
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn bubblesort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::BubbleSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
    #[test]
    fn insertionsort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::InsertionSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
    #[test]
    fn mergesort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::MergeSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
    #[test]
    fn quicksort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::QuickSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
    #[test]
    fn selectionsort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::SelectionSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
    #[test]
    fn shellsort() {
        let mut ar = [1, 5, 3, 2, 4, 4];

        let sorter = Sorter {
            sort_type: SortTypes::ShellSort,
        };
        sorter.sort(&mut ar);

        assert_eq!([1, 2, 3, 4, 4, 5], ar);
    }
}