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

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

    let m = b.len();

    let mut i = 0;

    let mut j = 0;

    let mut res = Vec::with_capacity(n + m);

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

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

            j += 1;
        }
    }

    res.extend(a[i..].to_owned().into_iter());

    res.extend(b[j..].to_owned().into_iter());

    res
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

        for ((a, b), ans) in cases {
            assert_eq!(merge_sorted(&a, &b), ans);
        }
    }
}