input: Write a function that performs a binary search on a sorted array to determine if a given value is present. If the value is found, return True, otherwise 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, 6, 7], 5) == False
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 1) == True
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 7) == True
  assert binarySearch([], 5) == 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)