def binary_search(a, key):
low = 0
high = len(a) - 1
while low < high:
mid = (low + high) // 2
if key == a[mid]:
return True
elif key < mid:
high = mid - 1
else:
low = mid + 1
return Falsedef binary_search(arr, item):
first = 0
last = len(arr) - 1
while(first <= last):
mid = (first + last) // 2
if arr[mid] == item :
return True
elif item < arr[mid]:
last = mid - 1
else:
first = mid + 1
return False#the best binary search you'll ever witness
def binary_search(arr, target):
mid = arr[len(arr)//2]
if mid == target:
return True
if len(arr) == 1 and mid != target:
return False
if mid < target:
return binary_search(arr[len(arr)//2: len(arr)], target)
else:
return binary_search(arr[0:len(arr)//2], target)#blog.icodes.tech
def binary_search(item,my_list):
found=False
first=0
last=len(my_list)-1
while first <=last and found==False:
midpoint=(first+last)//2
if my_list[midpoint]==item:
found=True
else:
if my_list[midpoint]<item:
first=midpoint+1
else:
last=midpoint-1
return founddef binary_search(l : list, z : int) -> int: # z = the value being searched
front = 0
rear = len(l) - 1
mid = (front + rear) // 2
while front <= rear and l[mid] != z:
if l[mid] > z:
rear = mid - 1
else:
front = mid + 1
mid = (front + rear) // 2
return mid if l[mid] == z else -1# This is real binary search
# this algorithm works very good because it is recursive
def binarySearch(arr, min, max, x):
if max >= min:
i = int(min + (max - min) / 2) # average
if arr[i] == x:
return i
elif arr[i] < x:
return binarySearch(arr, i + 1, max, x)
else:
return binarySearch(arr, min, i - 1, x)