forked from rampatra/Algorithms-and-Data-Structures-in-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTestBinarySearch
43 lines (34 loc) · 1.1 KB
/
TestBinarySearch
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
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test;
class TestSearch {
BinarySearch binarySearch = new BinarySearch() ;
@Test
public void tesInsertIntoSorted() {
int[] inputArr = new int[] {0,1,2,3,4};
assertTrue( binarySearch.binarySearch(inputArr, 2) ==2 );
}
BinarySearch binarySearch1 = new BinarySearch() ;
@Test
public void tesInsertIntoSorted1() {
int[] inputArr = new int[] {0,1,2,3,4};
assertTrue( binarySearch1.binarySearch(inputArr, 1)==1 );
}
BinarySearch binarySearch2 = new BinarySearch() ;
@Test
public void tesInsertIntoSorted2() {
int[] inputArr = new int[] {0,1,2,3,4};
assertTrue( binarySearch2.binarySearch(inputArr, 0)==0 );
}
BinarySearch binarySearch3 = new BinarySearch() ;
@Test
public void tesInsertIntoSorted3() {
int[] inputArr = new int[] {0,1,2,3,4};
assertTrue( binarySearch3.binarySearch(inputArr, 1)==1 );
}
BinarySearch binarySearch4 = new BinarySearch() ;
@Test
public void tesInsertIntoSorted4() {
int[] inputArr = new int[] {0,1,2,3,4};
assertTrue( binarySearch4.binarySearch(inputArr, 1)==1 );
}
}