input: Write a function to implement binary search on a given sorted array and determine if a target value is present in the array. If the target value is found, return True; otherwise, return False. If the array is empty, return False.
  def binarySearch(array, target):
      if len(array) == 0:
          return False
      mid = len(array) // 2
      if array[mid] == target:
          return True
      elif target < array[mid]:
          return binarySearch(array[:mid], target)
      else:
          return binarySearch(array[mid+1:], target)
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 5)==True
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 8)==False
  assert binarySearch([], 5)==False
  assert binarySearch([1, 3, 5, 7], 3)==True
  assert binarySearch([1, 3, 5, 7], 4)==False
output: def binarySearch(array, target):
      if len(array) == 0:
          return False
      mid = len(array) // 2
      if array[mid] == target:
          return True
      elif target < array[mid]:
          return binarySearch(array[:mid], target)
      else:
          return binarySearch(array[mid+1:], target)