algorithmz 1.3.0

This is the corresponding implemenation of the python module of the same name.
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

/// Switch pairs
///
/// Switch successive pairs of values in a stack starting from the bottom. If there is an odd number of values, the top element is not moved. Two approaches: one using an auxiliary stack, one using an auxiliary queue.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::stack::switch_pairs(vec![3, 8, 17, 9, 1, 10]);
/// assert_eq!(result, vec![8, 3, 9, 17, 10, 1]);
/// ```
pub fn switch_pairs(mut input: Vec<i32>) -> Vec<i32> {
    let mut storage_stack: Vec<i32> = Vec::new();

    for _ in 0..input.len() {
        storage_stack.push(input.pop().unwrap());
    }
    for _ in 0..((storage_stack.len() + 1) / 2) {
        let first = storage_stack.pop().unwrap();
        if storage_stack.len() == 0 {
            input.push(first);
            break;
        }
        let second = storage_stack.pop().unwrap();
        input.push(second);
        input.push(first);
    }
    return input;
}