





from __future__ import annotations



def        __lowercase       (				_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )			->       int | float:


      '''simple docstring'''


      if len(_SCREAMING_SNAKE_CASE     ) == 0:
            raise ValueError("""find_max() arg is an empty sequence"""     )
      if (
          left >= len(_SCREAMING_SNAKE_CASE     )
          or left < -len(_SCREAMING_SNAKE_CASE     )
          or right >= len(_SCREAMING_SNAKE_CASE     )
          or right < -len(_SCREAMING_SNAKE_CASE     )
      ):
            raise IndexError("""list index out of range"""     )
      if left == right:
            return nums[left]
      SCREAMING_SNAKE_CASE		=						(left + right) >> 1  # the middle
      SCREAMING_SNAKE_CASE		=						find_max(_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )  # find max in range[left, mid]
      SCREAMING_SNAKE_CASE		=						find_max(_SCREAMING_SNAKE_CASE			,						mid + 1			,						_SCREAMING_SNAKE_CASE     )  # find max in range[mid + 1, right]

      return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)









from __future__ import annotations



def        __lowercase       (				_SCREAMING_SNAKE_CASE			,						_SCREAMING_SNAKE_CASE     )			->       list[int]:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						0
      SCREAMING_SNAKE_CASE		=						len(_SCREAMING_SNAKE_CASE     ) - 1

      while i < j:
            if nums[i] + nums[j] == target:
                  return [i, j]
            elif nums[i] + nums[j] < target:
                  SCREAMING_SNAKE_CASE		=						i + 1
            else:
                  SCREAMING_SNAKE_CASE		=						j - 1

      return []


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      print(F'''{two_pointer([2, 7, 1_1, 1_5], 9) = }''')


