Repository navigation
Expand file tree
/
Copy pathWiggleSortTest.java
More file actions
92 lines (80 loc) · 2.93 KB
/
Copy pathWiggleSortTest.java
File metadata and controls
92 lines (80 loc) · 2.93 KB
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
81
82
83
84
85
86
87
88
89
90
91
92
package com.thealgorithms.sorts;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import static org.junit.jupiter.api.Assertions.assertThrows;
import java.util.Arrays;
import org.junit.jupiter.api.Test;
public class WiggleSortTest {
@Test
void wiggleTestNumbersEven() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 2, 3, 4};
Integer[] result = {1, 4, 2, 3};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestNumbersOdd() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 2, 3, 4, 5};
Integer[] result = {3, 5, 1, 4, 2};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestNumbersOddDuplicates() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {7, 2, 2, 2, 5};
Integer[] result = {2, 7, 2, 5, 2};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestNumbersOddMultipleDuplicates() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 1, 2, 2, 5};
Integer[] result = {2, 5, 1, 2, 1};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestNumbersEvenMultipleDuplicates() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 1, 2, 2, 2, 5};
Integer[] result = {2, 5, 1, 2, 1, 2};
wiggleSort.sort(values);
System.out.println(Arrays.toString(values));
assertArrayEquals(values, result);
}
@Test
void wiggleTestNumbersEvenDuplicates() {
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 2, 4, 4};
Integer[] result = {1, 4, 2, 4};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestStrings() {
WiggleSort wiggleSort = new WiggleSort();
String[] values = {"a", "b", "d", "c"};
String[] result = {"a", "d", "b", "c"};
wiggleSort.sort(values);
assertArrayEquals(values, result);
}
@Test
void wiggleTestNonWiggleSortableOddArrayThrows() {
// [1, 2, 2] is not wiggle-sortable: the median 2 appears ceil(3 / 2) = 2 times
// but is not the smallest value, so sorting must fail instead of returning
// a wrongly ordered array
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {1, 2, 2};
assertThrows(IllegalArgumentException.class, () -> wiggleSort.sort(values));
}
@Test
void wiggleTestTooManyDuplicatesThrows() {
// more than half of the values are the same, which can never be wiggle-sorted
WiggleSort wiggleSort = new WiggleSort();
Integer[] values = {2, 2, 2, 1};
assertThrows(IllegalArgumentException.class, () -> wiggleSort.sort(values));
}
}