algorithmz 1.0.7

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49

/// Returns the cocktail shaker sorted version of the input.
///
/// Takes a list reference as an input an returns a `Vec<i32>` or an error string.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::sorting::cocktail_shaker_sort(&[2,1,3,5,4,7,6,8]).unwrap();
/// assert_eq!(result,[1,2,3,4,5,6,7,8]);
/// ```
///
/// Match example:
/// ```
/// use algorithmz::sorting::cocktail_shaker_sort;
/// let my_list = [1,3,2,5,4,7,6,8];
/// match cocktail_shaker_sort(&my_list) {
///     Ok(n) => println!("The result was: {:?}",n),
///     Err(e) => eprintln!("The error was: {}",e),
/// }
/// ```
pub fn cocktail_shaker_sort(list: &[i32]) -> Result<Vec<i32>,String> {
    if list.is_empty() {
        return Err("Cannot use cocktail shaker sort on an empty list!".to_string());
    }
    let mut result = list.to_vec();
    let n = result.len();
    let mut swapped = true;
    while swapped {
        swapped = false;
        for i in 1..n {
            if result[i-1] > result[i] {
                result.swap(i-1,i);
                swapped = true;
            }
        }
        if !swapped {
            return Ok(result);
        }
        swapped = false;
        for i in (1..n).rev() {
            if result[i-1] > result[i] {
                result.swap(i-1,i);
                swapped = true
            }
        }
    }
    Ok(result)
}