```python
def binary_search(arr, target, low, high):
if low > high:
return -1 # Base case: not found
mid = low + (high - low) // 2
if arr[mid] == target:
return mid # Base case: found
elif arr[mid] > target:
return binary_search(arr, target, low, mid - 1) # Recurse left
else:
return binary_search(arr, target, mid + 1, high) # Recurse right
```