


def      lowerCAmelCase	(						lowerCAmelCase_	,				lowerCAmelCase_	)->	int:
				for index, item in enumerate(lowerCAmelCase_	):
								if item == target:
												return index
				return -1



def      lowerCAmelCase	(						lowerCAmelCase_	,				lowerCAmelCase_	,				lowerCAmelCase_	,				lowerCAmelCase_	)->	int:
				if not (0 <= high < len(lowerCAmelCase_	) and 0 <= low < len(lowerCAmelCase_	)):
								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(lowerCAmelCase_	,				low + 1	,				high - 1	,				lowerCAmelCase_	)


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

						_UpperCAmelCase     :					List[Any]       =int(input("""Enter a single number to be found in the list:\n""").strip())
						_UpperCAmelCase     :					int       =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      lowerCAmelCase	(						lowerCAmelCase_	,				lowerCAmelCase_	,				lowerCAmelCase_	)->	int | float:
				if len(lowerCAmelCase_	) == 0:
								raise ValueError('''find_min() arg is an empty sequence'''	)
				if (
				    left >= len(lowerCAmelCase_	)
				    or left < -len(lowerCAmelCase_	)
				    or right >= len(lowerCAmelCase_	)
				    or right < -len(lowerCAmelCase_	)
				):
								raise IndexError('''list index out of range'''	)
				if left == right:
								return nums[left]
				lowerCAmelCase_	: Any      			=			(left + right) >> 1  # the middle
				lowerCAmelCase_	: Tuple      			=			find_min(lowerCAmelCase_	,				lowerCAmelCase_	,				lowerCAmelCase_	)  # find min in range[left, mid]
				lowerCAmelCase_	: Any      			=			find_min(lowerCAmelCase_	,				mid + 1	,				lowerCAmelCase_	)  # find min in range[mid + 1, right]

				return left_min if left_min <= right_min else right_min


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)