forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinarySearchTest.java
More file actions
24 lines (19 loc) · 1006 Bytes
/
BinarySearchTest.java
File metadata and controls
24 lines (19 loc) · 1006 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
package com.search;
import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
class BinarySearchTest {
@Test
void testBinarySearch() {
Integer[] arr1 = {1, 2, 3, 4, 5};
Assertions.assertEquals(2, BinarySearch.findIndex(arr1, 3), "Incorrect index");
Assertions.assertEquals(0, BinarySearch.findIndex(arr1, 1), "Incorrect index");
Assertions.assertEquals(-1, BinarySearch.findIndex(arr1, 8), "Incorrect index");
Assertions.assertEquals(-1, BinarySearch.findIndex(arr1, -2), "Incorrect index");
String[] arr2 = {"A", "B", "C", "D"};
Assertions.assertEquals(2, BinarySearch.findIndex(arr2, "C"), "Incorrect index");
Assertions.assertEquals(1, BinarySearch.findIndex(arr2, "B"), "Incorrect index");
Assertions.assertEquals(-1, BinarySearch.findIndex(arr2, "F"), "Incorrect index");
String[] arr3 = {};
Assertions.assertEquals(-1, BinarySearch.findIndex(arr3, ""), "Incorrect index");
}
}