Binary Search Implementation

Created by user@example.com on March 28, 2025

python Algorithms 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
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1  # Target not found
# Example usage
sorted_array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
print(binary_search(sorted_array, 7))  # Output: 6 (index of 7 in the array)

1	def binary_search(arr, target):
2	left, right = 0, len(arr) - 1
3
4	while left <= right:
5	mid = (left + right) // 2
6
7	if arr[mid] == target:
8	return mid
9	elif arr[mid] < target:
10	left = mid + 1
11	else:
12	right = mid - 1
13
14	return -1 # Target not found
15
16	# Example usage
17	sorted_array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
18	print(binary_search(sorted_array, 7)) # Output: 6 (index of 7 in the array)