gerep/binary_search.py

## binary_search.py
def binary_search(target, arr):
    low = 0
    high = len(arr) - 1 # it starts with index 0

    while low <= high:
        mid = (low + high) // 2 # it represents the index of the middle element

        if arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1

    return low != len(arr) and arr[low] == target
	def binary_search(target, arr):
	low = 0
	high = len(arr) - 1 # it starts with index 0

	while low <= high:
	mid = (low + high) // 2 # it represents the index of the middle element

	if arr[mid] < target:
	low = mid + 1
	else:
	high = mid - 1

	return low != len(arr) and arr[low] == target