


__lowerCAmelCase     :			int      =1_0_0_0


def 	_UpperCamelCase							(				lowercase__				):
						return x * x


def 	_UpperCamelCase							(				lowercase__   ,	lowercase__   ,	lowercase__   ,	lowercase__ = 4				):
						assert callable(
						    lowercase__				), F'''the function(object) passed should be callable your input : {function}'''
						assert isinstance(lowercase__   ,	(float, int)				), F'''a should be float or integer your input : {a}'''
						assert isinstance(function(lowercase__				)   ,	(float, int)				), (
						    "the function should return integer or float return type of your function, "
						    F'''{type(lowercase__				)}'''
						)
						assert isinstance(lowercase__   ,	(float, int)				), F'''b should be float or integer your input : {b}'''
						assert (
						    isinstance(lowercase__   ,	lowercase__				) 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

						__SCREAMING_SNAKE_CASE						:					Optional[int]		      =		(b - a) / N_STEPS
						__SCREAMING_SNAKE_CASE						:					str		      =		function(lowercase__				) + function(lowercase__				)

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

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


if __name__ == "__main__":
						import doctest

						doctest.testmod()




from __future__ import annotations


def 	_UpperCamelCase							(				lowercase__				):
						__SCREAMING_SNAKE_CASE						:					List[Any]		      =		sorted(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					str		      =		len(lowercase__				)
						__SCREAMING_SNAKE_CASE						:					Union[str, Any]		      =		length >> 1
						return (
						    (sorted_list[mid_index] + sorted_list[mid_index - 1]) / 2
						    if length % 2 == 0
						    else sorted_list[mid_index]
						)


def 	_UpperCamelCase							(				):
						import doctest

						doctest.testmod()


if __name__ == "__main__":
						main()
