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>(
    a: Vec<T>,
    b: Vec<T>,
) -> Vec<T> {
    let mut res = Vec::with_capacity(a.len() + b.len());

    let mut a = a.into_iter();

    let mut b = b.into_iter();

    loop {
        let l = a.as_ref();

        let r = b.as_ref();

        if l.is_empty() || r.is_empty() {
            break;
        }

        if l[0] <= r[0] {
            res.push(a.next().unwrap());
        } else {
            res.push(b.next().unwrap());
        }
    }

    res.extend(a);

    res.extend(b);

    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);
        }
    }
}