algorithms 0.2.1

A library for most common 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
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

//! #Algorithms
//! A library for most common algorithms.

pub mod searching;
pub mod sorting;
pub mod data;


#[cfg(test)]
mod tests {
    #[test]
    fn quick_sort() {
        //descending
        let mut ve1 = vec![6, 5, 4, 3, 2, 1];
        crate::sorting::quick_sort(&mut ve1);
        for i in 0..ve1.len() - 1 {
            assert!(ve1[i] <= ve1[i + 1]);
        }

        //pre-sorted
        let mut ve2 = vec![1, 2, 3, 4, 5, 6];
        crate::sorting::quick_sort(&mut ve2);
        for i in 0..ve2.len() - 1 {
            assert!(ve2[i] <= ve2[i + 1]);
        }
    }
    #[test]
    fn bubble_sort() {
        //descending
        let mut ve1 = vec![6, 5, 4, 3, 2, 1];
        crate::sorting::bubble_sort(&mut ve1);
        for i in 0..ve1.len() - 1 {
            assert!(ve1[i] <= ve1[i + 1]);
        }

        //pre-sorted
        let mut ve2 = vec![1, 2, 3, 4, 5, 6];
        crate::sorting::bubble_sort(&mut ve2);
        for i in 0..ve2.len() - 1 {
            assert!(ve2[i] <= ve2[i + 1]);
        }
    }

    #[test]
    fn merge_sort(){
        //descending
        let mut ve1 = vec![6, 5, 4, 3, 2, 1];
        let result1=crate::sorting::merge_sort(&ve1);
        for i in 0..result1.len() - 1 {
            assert!(result1[i] <= result1[i + 1]);
        }

        //pre-sorted
        let mut ve2 = vec![1, 2, 3, 4, 5, 6];
        let result2=crate::sorting::merge_sort(&ve2);
        for i in 0..result2.len() - 1 {
            assert!(result2[i] <=result2[i + 1]);
        }
    }
}