
"""simple docstring"""





import math
from collections.abc import Callable



def 				lowerCamelCase__		(      __snake_case,					__snake_case,					__snake_case     )							->		float:


					"""simple docstring"""





					_UpperCamelCase										=  xa
					_UpperCamelCase										=  xa
					while True:
										if x_n == x_na or function(__snake_case     ) == function(__snake_case     ):
															raise ZeroDivisionError('''float division by zero, could not find root'''     )
										_UpperCamelCase										=  x_na - (
										    function(__snake_case     ) / ((function(__snake_case     ) - function(__snake_case     )) / (x_na - x_n))
										)
										if abs(x_na - x_na     ) < 10**-5:
															return x_na
										_UpperCamelCase										=  x_na
										_UpperCamelCase										=  x_na



def 				lowerCamelCase__		(      __snake_case     )							->		float:


					"""simple docstring"""





					return math.pow(__snake_case,					3     ) - (2 * x) - 5


if __name__ == "__main__":
				print(intersection(f, 3, 3.5))








"""simple docstring"""





from __future__ import annotations



def 				lowerCamelCase__		(      __snake_case,					__snake_case     )							->		Optional[int]:


					"""simple docstring"""





					if len(__snake_case     ) <= 1 or n <= 1:
										return

					insert_next(__snake_case,					n - 1     )
					rec_insertion_sort(__snake_case,					n - 1     )



def 				lowerCamelCase__		(      __snake_case,					__snake_case     )							->		Dict:


					"""simple docstring"""





					if index >= len(__snake_case     ) or collection[index - 1] <= collection[index]:
										return

					# Swaps adjacent elements since they are not in ascending order
					_UpperCamelCase			,  _UpperCamelCase										=  (
					    collection[index],
					    collection[index - 1],
					)

					insert_next(__snake_case,					index + 1     )


if __name__ == "__main__":
				_a														=		input("""Enter integers separated by spaces: """)
				_a														=		[int(num) for num in numbers.split()]
				rec_insertion_sort(number_list, len(number_list))
				print(number_list)






