dsalgo 0.3.10

A package for Datastructures 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
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

pub fn merge_sort<T: Ord + Clone>(mut a: Vec<T>) -> Vec<T> {
    fn dfs<T: Ord + Clone>(a: &mut [T]) {
        let n = a.len();

        if n <= 1 {
            return;
        }

        let m = n >> 1;

        dfs(&mut a[..m]);

        dfs(&mut a[m..]);

        let b = a.to_vec();

        let mut i = 0;

        let mut j = m;

        let mut k = 0;

        while i < m && j < n {
            if b[i] <= b[j] {
                a[k] = b[i].clone();

                i += 1;
            } else {
                a[k] = b[j].clone();

                j += 1;
            }

            k += 1;
        }

        if i < m {
            a[k..n].clone_from_slice(&b[i..m]);
        }
        // even if right is still remain, already sorted.
    }

    dfs(&mut a);

    a
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        let cases = vec![(
            vec![8, 5, 9, 2, 6, 3, 7, 1, 10, 4],
            vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10],
        )];

        for (a, ans) in cases {
            assert_eq!(merge_sort(a), ans);
        }
    }
}