Mastering Binary Search: Avoiding Off-By-One Errors & Overflow

def binary_search(arr, target):
    low, high = 0, len(arr) - 1
    while low <= high:
        mid = low + (high - low) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return -1

print("Target Index:", binary_search([1, 3, 5, 7, 9, 11], 7))