How do I implement binary search in Python?

How do I implement binary search in Python?

To implement binary search in Python, you can use a recursive or iterative approach. Which one would you prefer?

I think I prefer the iterative approach.

Great choice! Here's a simple iterative implementation:

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

Would you like an explanation of how this works?

Yes, please explain how it works.

Sure! The function takes a sorted array and a target value. It initializes two pointers, left and right, to the start and end of the array. In each iteration, it calculates the middle index and compares the middle element with the target. If they match, it returns the index. If the target is smaller, it narrows the search to the left half; if larger, to the right half. This process continues until the target is found or the pointers cross.