input: Write a function to implement a binary search algorithm that searches for a given value in a sorted array. If the value is found in the array, the function should return True, otherwise it should return False.
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 5)==True
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 8)==False
  assert binarySearch([], 10)==False
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 1)==True
  assert binarySearch([1, 2, 3, 4, 5, 6, 7], 7)==True
output: def binarySearch(arr, target):
      left, right = 0, len(arr) - 1
      while left <= right:
          mid = (left + right) // 2
          if arr[mid] == target:
              return True
          elif arr[mid] < target:
              left = mid + 1
          else:
              right = mid - 1
      return False