




def 							__SCREAMING_SNAKE_CASE  (      snake_case_     ,   snake_case_						):

						'''simple docstring'''


						for index, item in enumerate(snake_case_						):
												if item == target:
																		return index
						return -1


def 							__SCREAMING_SNAKE_CASE  (      snake_case_     ,   snake_case_     ,   snake_case_     ,   snake_case_						):

						'''simple docstring'''


						if not (0 <= high < len(snake_case_						) and 0 <= low < len(snake_case_						)):
												raise Exception("Invalid upper or lower bound!"						)
						if high < low:
												return -1
						if sequence[low] == target:
												return low
						if sequence[high] == target:
												return high
						return rec_linear_search(snake_case_     ,   low + 1     ,   high - 1     ,   snake_case_						)


if __name__ == "__main__":
				lowercase_     :    List[str]      =			input('Enter numbers separated by comma:\n').strip()
				lowercase_     :    Any      =			[int(item.strip()) for item in user_input.split(',')]

				lowercase_     :    Optional[Any]      =			int(input('Enter a single number to be found in the list:\n').strip())
				lowercase_     :    Union[str, Any]      =			linear_search(sequence, target)
				if result != -1:
								print(f"""linear_search({sequence}, {target}) = {result}""")
				else:
								print(f"""{target} was not found in {sequence}""")










from __future__ import annotations


def 							__SCREAMING_SNAKE_CASE  (      snake_case_     ,   snake_case_						):

						'''simple docstring'''


						_UpperCAmelCase													=					{}
						for index, val in enumerate(snake_case_						):
												_UpperCAmelCase													=					target - val
												if compl in chk_map:
																		return [chk_map[compl], index]
												_UpperCAmelCase													=					index
						return []


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				print(f"""{two_sum([2, 7, 11, 15], 9) = }""")




