- Notifications
You must be signed in to change notification settings - Fork 19.9k
/
Copy pathFibonacciSearchTest.java
124 lines (111 loc) · 4.66 KB
/
FibonacciSearchTest.java
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
packagecom.thealgorithms.searches;
importstaticorg.junit.jupiter.api.Assertions.assertEquals;
importstaticorg.junit.jupiter.api.Assertions.assertThrows;
importjava.util.stream.IntStream;
importorg.junit.jupiter.api.Test;
/**
* Unit tests for the FibonacciSearch class.
*/
classFibonacciSearchTest {
/**
* Test for basic Fibonacci search functionality.
*/
@Test
voidtestFibonacciSearchFound() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};
intkey = 128;
intexpectedIndex = 7; // Index of the key in the array
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The index of the found element should be 7.");
}
/**
* Test for Fibonacci search when the element is not present.
*/
@Test
voidtestFibonacciSearchNotFound() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1, 2, 4, 8, 16};
intkey = 6; // Element not present in the array
intexpectedIndex = -1; // Key not found
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The element should not be found in the array.");
}
/**
* Test for Fibonacci search with the first element as the key.
*/
@Test
voidtestFibonacciSearchFirstElement() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1, 2, 4, 8, 16};
intkey = 1; // First element
intexpectedIndex = 0; // Index of the key in the array
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The index of the first element should be 0.");
}
/**
* Test for Fibonacci search with the last element as the key.
*/
@Test
voidtestFibonacciSearchLastElement() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1, 2, 4, 8, 16};
intkey = 16; // Last element
intexpectedIndex = 4; // Index of the key in the array
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The index of the last element should be 4.");
}
/**
* Test for Fibonacci search with a single element present.
*/
@Test
voidtestFibonacciSearchSingleElementFound() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1};
intkey = 1; // Only element present
intexpectedIndex = 0; // Index of the key in the array
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The index of the single element should be 0.");
}
/**
* Test for Fibonacci search with a single element not present.
*/
@Test
voidtestFibonacciSearchSingleElementNotFound() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1};
intkey = 2; // Key not present
intexpectedIndex = -1; // Key not found
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The element should not be found in the array.");
}
/**
* Test for Fibonacci search with an empty array.
*/
@Test
voidtestFibonacciSearchEmptyArray() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {}; // Empty array
intkey = 1; // Key not present
assertThrows(IllegalArgumentException.class, () -> fibonacciSearch.find(array, key), "An empty array should throw an IllegalArgumentException.");
}
@Test
voidtestFibonacciSearchUnsortedArray() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {2, 1, 4, 3, 6, 5};
intkey = 3; // Key not present
assertThrows(IllegalArgumentException.class, () -> fibonacciSearch.find(array, key), "An unsorted array should throw an IllegalArgumentException.");
}
@Test
voidtestFibonacciSearchNullKey() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = {1, 2, 4, 8, 16};
Integerkey = null; // Null key
assertThrows(IllegalArgumentException.class, () -> fibonacciSearch.find(array, key), "A null key should throw an IllegalArgumentException.");
}
/**
* Test for Fibonacci search on large array.
*/
@Test
voidtestFibonacciSearchLargeArray() {
FibonacciSearchfibonacciSearch = newFibonacciSearch();
Integer[] array = IntStream.range(0, 10000).boxed().toArray(Integer[] ::new); // Array from 0 to 9999
intkey = 9999;
intexpectedIndex = 9999;
assertEquals(expectedIndex, fibonacciSearch.find(array, key), "The index of the last element should be 9999.");
}
}