sorting-algorithm 0.1.17

An implementation of various sorting 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
62
63
64
65
66
67
68
69
70
71

use sorting_algorithm::merge_sort::sort;
use fastrand;

#[test]
fn test_random_data() {
    for n in [1, 10, 100, 1_000] { 
        let mut data: Vec<u32> = (0..n as u32).collect();
        fastrand::shuffle(&mut data);

        let mut expected = data.clone();
        expected.sort();

        sort(&mut data);

        assert_eq!(data, expected);
    }
}

#[test]
fn test_sorted_data() {
    for n in [1, 10, 100, 1_000] {
        let mut data: Vec<u32> = (0..n).collect();

        let expected = data.clone();

        sort(&mut data);

        assert_eq!(data, expected);
    }
}

#[test]
fn test_reversed_data() {
    for n in [1, 10, 100, 1_000] {
        let mut data: Vec<u32> = (0..n).rev().collect();

        let mut expected = data.clone();
        expected.sort();

        sort(&mut data);

        assert_eq!(data, expected);
    }
}

#[test]
fn test_empty_data() {
    let mut data: [u32; 0] = [];

    sort(&mut data);

    assert_eq!(data, []);
}

#[test]
fn test_repeated_number() {
    for n in [1, 10, 100, 1_000] {
        let mut data: Vec<u32> = Vec::new();

        for _ in 0..n {
            data.push(0);
        }

        let mut expected = data.clone();
        expected.sort();

        sort(&mut data);

        assert_eq!(data, expected);
    }
}