
"""simple docstring"""
import math
from timeit import timeit


def     lowerCamelCase_    (	lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					__a:						Optional[int]		    =					0
					__a:						Dict		    =					abs(lowerCamelCase_ )
					while True:
										__a:						Dict		    =					n // 10
										digits += 1
										if n == 0:
															break
					return digits


def     lowerCamelCase_    (	lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					return 1 if n == 0 else math.floor(math.log(abs(lowerCamelCase_ )	,				10 ) + 1 )


def     lowerCamelCase_    (	lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					return len(str(abs(lowerCamelCase_ ) ) )


def     lowerCamelCase_    (	)     ->			None:


					'''simple docstring'''
					from collections.abc import Callable

					def benchmark_a_function(lowerCamelCase_	,				lowerCamelCase_ ) -> None:
										__a:						Optional[int]		    =					f"""{func.__name__}({value})"""
										__a:						Any		    =					timeit(f"""__main__.{call}"""	,				setup="""import __main__""" )
										print(f"""{call}: {func(lowerCamelCase_ )} -- {timing} seconds""" )

					for value in (26_21_44, 11_25_89_99_06_84_26_24, 1_26_76_50_60_02_28_22_94_01_49_67_03_20_53_76):
										for func in (num_digits, num_digits_fast, num_digits_faster):
															benchmark_a_function(lowerCamelCase_	,				lowerCamelCase_ )
										print()


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			benchmark()


"""simple docstring"""
def     lowerCamelCase_    (	lowerCamelCase_	,				lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					for index, item in enumerate(lowerCamelCase_ ):
										if item == target:
															return index
					return -1


def     lowerCamelCase_    (	lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_	,				lowerCamelCase_ )     ->			int:


					'''simple docstring'''
					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__":
			lowercase		:						str =					input('Enter numbers separated by comma:\n').strip()
			lowercase		:						int =					[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		:						str =					linear_search(sequence, target)
			if result != -1:
						print(F"linear_search({sequence}, {target}) = {result}")
			else:
						print(F"{target} was not found in {sequence}")
