Binary search in Python

 

def binary_search(arr, target):

    left, right = 0, len(arr) - 1

    while left <= right:

        mid = (left + right) // 2

        if arr[mid] == target:

            return mid  # Found the target, return its index

        elif arr[mid] < target:

            left = mid + 1  # Target is in the right half

        else:

            right = mid - 1  # Target is in the left half

    return -1  # Target is not in the list

# Example usage:

arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

target = 6

result = binary_search(arr, target)

if result != -1:

    print(f"Element {target} found at index {result}")

else:

    print(f"Element {target} not found in the list")

#clcoding.com