



'''simple docstring'''




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


def     lowerCAmelCase_       (     _lowerCamelCase:       list	,				_lowerCamelCase:       int	,				_lowerCamelCase:       int	,				_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__	:     Optional[Any]    =			input('''Enter numbers separated by comma:\n''').strip()
						UpperCamelCase__	:     List[str]    =			[int(item.strip()) for item in user_input.split(''',''')]

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




'''simple docstring'''




from __future__ import annotations


def     lowerCAmelCase_       (     _lowerCamelCase:       list[int | float] ):
		if len(_lowerCamelCase ) == 0:
				raise ValueError("""find_min() arg is an empty sequence""" )
		__SCREAMING_SNAKE_CASE	:		List[str]   	=		nums[0]
		for num in nums:
				__SCREAMING_SNAKE_CASE	:		int   	=		min(_lowerCamelCase	,				_lowerCamelCase )
		return min_num


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)