input: Write a function to search for a target value in a given sorted array using the binary search algorithm. If the value is found in the array, return True; otherwise, 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([1], 1)==True
  assert binarySearch([1, 3, 5, 7], 4)==False
  assert binarySearch([], 2)==False
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