algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: include BL_BURYING_LOGIC (#7277)

Browse Source
This commit is contained in:
Piotr Idzik
2026-02-18 20:32:32 +01:00
committed by GitHub
parent 2ae1bdfd9a
commit 0a2c7f2e3b
2 changed files with 17 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
spotbugs-exclude.xml
View File

@@ -90,9 +90,6 @@
<Match>
<Bug pattern="USBR_UNNECESSARY_STORE_BEFORE_RETURN" />
</Match>
<Match>
<Bug pattern="BL_BURYING_LOGIC" />
</Match>
<Match>
<Bug pattern="MUI_CONTAINSKEY_BEFORE_GET" />
</Match>

35
src/main/java/com/thealgorithms/searches/RecursiveBinarySearch.java
View File

@@ -23,28 +23,27 @@ public class RecursiveBinarySearch<T extends Comparable<T>> extends SearchAlgori
// Recursive binary search function
public int binsear(T[] arr, int left, int right, T target) {
if (right >= left) {
int mid = left + (right - left) / 2;
if (right < left) {
// Element is not present in the array
return -1;
}
final int mid = left + (right - left) / 2;
// Compare the element at the middle with the target
int comparison = arr[mid].compareTo(target);
// Compare the element at the middle with the target
final int comparison = arr[mid].compareTo(target);
// If the element is equal to the target, return its index
if (comparison == 0) {
return mid;
}
// If the element is greater than the target, search in the left subarray
if (comparison > 0) {
return binsear(arr, left, mid - 1, target);
}
// Otherwise, search in the right subarray
return binsear(arr, mid + 1, right, target);
// If the element is equal to the target, return its index
if (comparison == 0) {
return mid;
}
// Element is not present in the array
return -1;
// If the element is greater than the target, search in the left subarray
if (comparison > 0) {
return binsear(arr, left, mid - 1, target);
}
// Otherwise, search in the right subarray
return binsear(arr, mid + 1, right, target);
}
public static void main(String[] args) {