-
-
Notifications
You must be signed in to change notification settings - Fork 2.4k
/
Copy pathwiggle_sort.rs
80 lines (71 loc) · 2.1 KB
/
wiggle_sort.rs
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
75
76
77
78
79
80
//Wiggle Sort.
//Given an unsorted array nums, reorder it such
//that nums[0] < nums[1] > nums[2] < nums[3]....
//For example:
//if input numbers = [3, 5, 2, 1, 6, 4]
//one possible Wiggle Sorted answer is [3, 5, 1, 6, 2, 4].
pub fn wiggle_sort(nums: &mut Vec<i32>) -> &mut Vec<i32> {
//Rust implementation of wiggle.
// Example:
// >>> wiggle_sort([0, 5, 3, 2, 2])
// [0, 5, 2, 3, 2]
// >>> wiggle_sort([])
// []
// >>> wiggle_sort([-2, -5, -45])
// [-45, -2, -5]
let len = nums.len();
for i in 1..len {
let num_x = nums[i - 1];
let num_y = nums[i];
if (i % 2 == 1) == (num_x > num_y) {
nums[i - 1] = num_y;
nums[i] = num_x;
}
}
nums
}
#[cfg(test)]
mod tests {
use super::*;
use crate::sorting::have_same_elements;
fn is_wiggle_sorted(nums: &[i32]) -> bool {
if nums.is_empty() {
return true;
}
let mut previous = nums[0];
let mut result = true;
nums.iter().enumerate().skip(1).for_each(|(i, &item)| {
if i != 0 {
result =
result && ((i % 2 == 1 && previous < item) || (i % 2 == 0 && previous > item));
}
previous = item;
});
result
}
#[test]
fn wingle_elements() {
let arr = vec![3, 5, 2, 1, 6, 4];
let mut cloned = arr.clone();
let res = wiggle_sort(&mut cloned);
assert!(is_wiggle_sorted(res));
assert!(have_same_elements(res, &arr));
}
#[test]
fn odd_number_of_elements() {
let arr = vec![4, 1, 3, 5, 2];
let mut cloned = arr.clone();
let res = wiggle_sort(&mut cloned);
assert!(is_wiggle_sorted(res));
assert!(have_same_elements(res, &arr));
}
#[test]
fn repeated_elements() {
let arr = vec![5, 5, 5, 5];
let mut cloned = arr.clone();
let res = wiggle_sort(&mut cloned);
// Negative test, can't be wiggle sorted
assert!(!is_wiggle_sorted(res));
assert!(have_same_elements(res, &arr));
}
}