python binary search
def 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 Falsebinary search python
# 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)Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
