code: def in_sorted(values, value):
      
      index = bisect.bisect_left(values, value)
      if index >= len(values):
          return False
  
      return values[index] == value
docs: Checks if a value is in a sorted list.
  
      Uses the :mod:`bisect` builtin to find the insertion point for
      ``value``.
  
      Args:
          values (List[int]): Integers sorted in ascending order.
          value (int): Value to check if contained in ``values``.
  
      Returns:
          bool: Indicating if the value is contained.