bs

bs.py

b = [1,2,3,4,5]
k = 6
l = 0
h = len(b)

def binary_Search(b,l,h,k):
  m = (l+h)//2
  #print(m)
  if b[m] == k:
    return True
  elif m < h-1 and b[m] < k:
    return binary_Search(b,m,h,k)
  elif l < m and b[m] > k:
    print(b[m])
    return binary_Search(b,l,m,k)
  else:
    return False

print(binary_Search(b,l,h,k))