/**
 * One way to implement a recursive binary search algorithm
 *
 * @author Chris Thiel, ofmcap
 * @version 21 Jan 2026
 */
public class BinarySearch
{
    public int binarySearch (int[] arr, int target){
        int left = 0;
        int right = arr.length -1;
        return binarySearch(arr, target, left, right);
    }

    public int binarySearch(int[] arr, int target, int left, int right){
        int mid = (left + right)/2;
        if (arr[mid] == target)
            return mid;
        if (left >= right)
            return -1;

        if (arr[mid] < target)
            return binarySearch(arr, target, mid+1, right); 
        return binarySearch(arr, target, left, mid-1);
    }

}