Could someone explain how the Binary Search algorithm works with a simple Python example?

[ammiyo]

I need this

[isthatpratham]

Binary Search works on sorted arrays by repeatedly dividing the search interval in half. Here is a simple implementation:

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