Repository navigation
Expand file tree
/
Copy pathTernarySearchTest.java
More file actions
143 lines (111 loc) · 4.03 KB
/
Copy pathTernarySearchTest.java
File metadata and controls
143 lines (111 loc) · 4.03 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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
package com.thealgorithms.searches;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertTrue;
import org.junit.jupiter.api.Test;
class TernarySearchTest {
@Test
void testFindElementInSortedArray() {
Integer[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 5);
assertEquals(4, index, "Should find the element 5 at index 4");
}
@Test
void testElementNotFound() {
Integer[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 11);
assertEquals(-1, index, "Should return -1 for element 11 which is not present");
}
@Test
void testFindFirstElement() {
Integer[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 1);
assertEquals(0, index, "Should find the first element 1 at index 0");
}
@Test
void testFindLastElement() {
Integer[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 10);
assertEquals(9, index, "Should find the last element 10 at index 9");
}
@Test
void testFindInLargeArray() {
Integer[] arr = new Integer[1000];
for (int i = 0; i < 1000; i++) {
arr[i] = i + 1; // Array from 1 to 1000
}
TernarySearch search = new TernarySearch();
int index = search.find(arr, 500);
assertEquals(499, index, "Should find element 500 at index 499");
}
@Test
void testNegativeNumbers() {
Integer[] arr = {-10, -5, -3, -1, 0, 1, 3, 5, 7, 10};
TernarySearch search = new TernarySearch();
int index = search.find(arr, -3);
assertEquals(2, index, "Should find the element -3 at index 2");
}
@Test
void testEdgeCaseEmptyArray() {
Integer[] arr = {};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 5);
assertEquals(-1, index, "Should return -1 for an empty array");
}
@Test
void testNullArrayReturnsMinusOne() {
TernarySearch search = new TernarySearch();
assertEquals(-1, search.find(null, 5));
}
@Test
void testNullKeyReturnsMinusOne() {
Integer[] arr = {1, 2, 3, 4, 5};
TernarySearch search = new TernarySearch();
assertEquals(-1, search.find(arr, null));
}
@Test
void testSingleElementPresent() {
Integer[] arr = {42};
TernarySearch search = new TernarySearch();
assertEquals(0, search.find(arr, 42));
}
@Test
void testSingleElementAbsent() {
Integer[] arr = {42};
TernarySearch search = new TernarySearch();
assertEquals(-1, search.find(arr, 24));
}
@Test
void testTwoElements() {
Integer[] arr = {10, 20};
TernarySearch search = new TernarySearch();
assertEquals(0, search.find(arr, 10));
assertEquals(1, search.find(arr, 20));
assertEquals(-1, search.find(arr, 15));
}
@Test
void testMiddlePartitionSearch() {
Integer[] arr = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19};
TernarySearch search = new TernarySearch();
assertEquals(3, search.find(arr, 7));
assertEquals(4, search.find(arr, 9));
assertEquals(5, search.find(arr, 11));
}
@Test
void testDuplicateElements() {
Integer[] arr = {1, 2, 2, 2, 3};
TernarySearch search = new TernarySearch();
int index = search.find(arr, 2);
assertTrue(index >= 1 && index <= 3, "Index should be one of the occurrences of 2");
}
@Test
void testGenericStrings() {
String[] words = {"apple", "banana", "cherry", "date", "elderberry"};
TernarySearch search = new TernarySearch();
assertEquals(2, search.find(words, "cherry"));
assertEquals(-1, search.find(words, "fig"));
}
}