



from __future__ import annotations

from collections.abc import Callable





def 						__lowerCamelCase       (      __magic_name__	:  Callable[[int | float], int | float]     , __magic_name__	:  int | float     , __magic_name__	:  int | float     , __magic_name__	:  int = 100     , ):
							a__:       Any											=x_start
							a__:       Dict											=fnc(__magic_name__						)
							a__:       Tuple											=0.0

							for _ in range(__magic_name__						):
														# Approximates small segments of curve as linear and solve
														# for trapezoidal area
														a__:       int											=(x_end - x_start) / steps + xa
														a__:       Union[str, Any]											=fnc(__magic_name__						)
														area += abs(fxa + fxa						) * (xa - xa) / 2

														# Increment step
														a__:       int											=xa
														a__:       Union[str, Any]											=fxa
							return area


if __name__ == "__main__":





		def 						__lowerCamelCase       (      __magic_name__	:  str						):
									return x**3

		print('''f(x) = x^3''')
		print('''The area between the curve, x = -10, x = 10 and the x axis is:''')
		__UpperCAmelCase						  =     10
		while i <= 10_00_00:
				__UpperCAmelCase						  =     trapezoidal_area(f, -5, 5, i)
				print(f"""with {i} steps: {area}""")
				i *= 10











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





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


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

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





