



__magic_name__       =     1000





def 		__snake_case						(    _UpperCAmelCase				):
					"""simple docstring"""






					return x * x





def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase = 4				):
					"""simple docstring"""






					assert callable(
					    _UpperCAmelCase				), f"""the function(object) passed should be callable your input : {function}"""
					assert isinstance(_UpperCAmelCase       ,			(float, int)				), f"""a should be float or integer your input : {a}"""
					assert isinstance(function(_UpperCAmelCase				)       ,			(float, int)				), (
					    "the function should return integer or float return type of your function, "
					    f"""{type(_UpperCAmelCase				)}"""
					)
					assert isinstance(_UpperCAmelCase       ,			(float, int)				), f"""b should be float or integer your input : {b}"""
					assert (
					    isinstance(_UpperCAmelCase       ,			_UpperCAmelCase				) and precision > 0
					), f"""precision should be positive integer your input : {precision}"""

					# just applying the formula of simpson for approximate integration written in
					# mentioned article in first comment of this file and above this function

					lowercase						   =       (b - a) / N_STEPS
					lowercase						   =       function(_UpperCAmelCase				) + function(_UpperCAmelCase				)

					for i in range(1       ,			_UpperCAmelCase				):
										lowercase						   =       a + h * i
										result += function(_UpperCAmelCase				) * (4 if i % 2 else 2)

					result *= h / 3
					return round(_UpperCAmelCase       ,			_UpperCAmelCase				)


if __name__ == "__main__":
		import doctest

		doctest.testmod()











def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase				):
					"""simple docstring"""






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





def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase				):
					"""simple docstring"""






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


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

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






