forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDarkSortTest.java
More file actions
74 lines (53 loc) · 1.83 KB
/
DarkSortTest.java
File metadata and controls
74 lines (53 loc) · 1.83 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
package com.thealgorithms.sorts;
import static org.junit.jupiter.api.Assertions.assertArrayEquals;
import static org.junit.jupiter.api.Assertions.assertNull;
import org.junit.jupiter.api.Test;
class DarkSortTest {
@Test
void testSortWithIntegers() {
Integer[] unsorted = {5, 3, 8, 6, 2, 7, 4, 1};
Integer[] expected = {1, 2, 3, 4, 5, 6, 7, 8};
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertArrayEquals(expected, sorted);
}
@Test
void testEmptyArray() {
Integer[] unsorted = {};
Integer[] expected = {};
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertArrayEquals(expected, sorted);
}
@Test
void testSingleElementArray() {
Integer[] unsorted = {42};
Integer[] expected = {42};
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertArrayEquals(expected, sorted);
}
@Test
void testAlreadySortedArray() {
Integer[] unsorted = {1, 2, 3, 4, 5};
Integer[] expected = {1, 2, 3, 4, 5};
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertArrayEquals(expected, sorted);
}
@Test
void testDuplicateElementsArray() {
Integer[] unsorted = {4, 2, 7, 2, 1, 4};
Integer[] expected = {1, 2, 2, 4, 4, 7};
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertArrayEquals(expected, sorted);
}
@Test
void testNullArray() {
Integer[] unsorted = null;
DarkSort darkSort = new DarkSort();
Integer[] sorted = darkSort.sort(unsorted);
assertNull(sorted, "Sorting a null array should return null");
}
}