algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-28 06:55:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added [FEATURE REQUEST] <Recursive Binary Search> #4457 (#4469)

Browse Source 
* Create RecursiveBinarySearch.java

* Update RecursiveBinarySearch.java

* Update RecursiveBinarySearch.java

* Update RecursiveBinarySearch.java

* Update RecursiveBinarySearch.java

* Create ReverseArray.java

* Update RecursiveBinarySearch.java

* Update RecursiveBinarySearch.java

* Create RecursiveBinarySearchTest.java

* Update RecursiveBinarySearchTest.java

* Update RecursiveBinarySearchTest.java

* Delete src/main/java/com/thealgorithms/others/ReverseArray.java

* Update RecursiveBinarySearchTest.java

* Update RecursiveBinarySearchTest.java

* Create ReverseArray.java

* Delete src/main/java/com/thealgorithms/others/ReverseArray.java

* Update RecursiveBinarySearchTest.java

* Update RecursiveBinarySearch.java
This commit is contained in:
Pronay Debnath
2023-10-01 20:52:51 +05:30
committed by GitHub
parent ee2629c8ab
commit da687c11cb
2 changed files with 114 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
src/test/java/com/thealgorithms/searches/RecursiveBinarySearchTest.java Normal file
View File

@ -0,0 +1,40 @@
// Created by Pronay Debnath
// Date:- 1/10/2023
// Test file updated with JUnit tests
import static org.junit.jupiter.api.Assertions.*;
import org.junit.jupiter.api.Test; // Import the JUnit 5 Test annotation
public class RecursiveBinarySearchTest {
@Test
public void testBinarySearch() {
// Create an instance of GenericBinarySearch
RecursiveBinarySearch<Integer> searcher = new RecursiveBinarySearch<>();
// Test case 1: Element found in the array
Integer[] arr1 = {1, 2, 3, 4, 5};
int target1 = 3;
int result1 = searcher.binsear(arr1, 0, arr1.length - 1, target1);
assertEquals(2, result1);
// Test case 2: Element not found in the array
Integer[] arr2 = {1, 2, 3, 4, 5};
int target2 = 6;
int result2 = searcher.binsear(arr2, 0, arr2.length - 1, target2);
assertEquals(-1, result2);
// Test case 3: Element found at the beginning of the array
Integer[] arr3 = {10, 20, 30, 40, 50};
int target3 = 10;
int result3 = searcher.binsear(arr3, 0, arr3.length - 1, target3);
assertEquals(0, result3);
// Test case 4: Element found at the end of the array
Integer[] arr4 = {10, 20, 30, 40, 50};
int target4 = 50;
int result4 = searcher.binsear(arr4, 0, arr4.length - 1, target4);
assertEquals(4, result4);
}
}