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

pub fn insertion_sort_states<T: Ord + Clone>(mut a: Vec<T>) -> Vec<Vec<T>> {
    let n = a.len();

    let mut res = vec![a.clone()];

    for i in 1..n {
        for j in (0..i).rev() {
            if a[j] <= a[j + 1] {
                break;
            }

            a.swap(j, j + 1);
        }

        res.push(a.clone());
    }

    res
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

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

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