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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
pub fn cocktail_sort<T: PartialOrd>(input: &mut [T]) {
if input.len() < 2 {return;}
let mut index_st = 0;
let mut index_end = input.len() - 1;
while index_st < index_end {
let slice = index_st..index_end;
index_end = index_st;
for i in slice {
if input[i] > input[i + 1] {
input.swap(i, i + 1);
index_end = i;
}
}
let slice = (index_st..index_end).rev();
index_st = index_end;
for i in slice {
if input[i] > input[i + 1] {
input.swap(i, i + 1);
index_st = i;
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_cocktail() {
let mut vector_in = vec![30, 10, 20, 11, 24, 44, 12, 11];
cocktail_sort(&mut vector_in);
debug_assert_eq!(vector_in, vec![10, 11, 11, 12, 20, 24, 30, 44]);
}
#[test]
fn test_cocktail_empty() {
let mut vector_in:Vec<i32> = vec![];
cocktail_sort(&mut vector_in);
debug_assert_eq!(vector_in, &[]);
}
#[test]
fn test_cocktail_len1() {
let mut vector_in = vec![1];
cocktail_sort(&mut vector_in);
debug_assert_eq!(vector_in, vec![1]);
}
}