


"""simple docstring"""
def 						lowercase				(	_snake_case		: list	,  _snake_case		: list	)	->list:
	"""simple docstring"""





	__snake_case      :		int         =							len(_snake_case	)
	__snake_case      :		int         =							len(_snake_case	)
	__snake_case      :		int         =							(
	    first_input_list_length
	    if first_input_list_length > second_input_list_length
	    else second_input_list_length
	)
	__snake_case      :		list         =							[]
	for char_count in range(_snake_case	):
		if char_count < first_input_list_length:
			output_result_list.append(first_input_list[char_count]	)
		if char_count < second_input_list_length:
			output_result_list.append(second_input_list[char_count]	)

	return output_result_list


if __name__ == "__main__":
			print(alternative_list_arrange(["""A""", """B""", """C"""], [1, 2, 3, 4, 5]), end=""" """)









"""simple docstring"""
SCREAMING_SNAKE_CASE					:       List[Any]							   =							1000






def 						lowercase				(	_snake_case		: float	)	->float:
	"""simple docstring"""





	return x * x






def 						lowercase				(	_snake_case		: Union[str, Any]	,  _snake_case		: float	,  _snake_case		: float	,  _snake_case		: int = 4	)	->float:
	"""simple docstring"""





	assert callable(
	    _snake_case	), f"""the function(object) passed should be callable your input : {function}"""
	assert isinstance(_snake_case	,  (float, int)	), f"""a should be float or integer your input : {a}"""
	assert isinstance(function(_snake_case	)	,  (float, int)	), (
	    "the function should return integer or float return type of your function, "
	    f"""{type(_snake_case	)}"""
	)
	assert isinstance(_snake_case	,  (float, int)	), f"""b should be float or integer your input : {b}"""
	assert (
	    isinstance(_snake_case	,  _snake_case	) 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

	__snake_case      :		Tuple         =							(b - a) / N_STEPS
	__snake_case      :		Union[str, Any]         =							function(_snake_case	) + function(_snake_case	)

	for i in range(1	,  _snake_case	):
		__snake_case      :		List[str]         =							a + h * i
		result += function(_snake_case	) * (4 if i % 2 else 2)

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


if __name__ == "__main__":
			import doctest

			doctest.testmod()





