



"""simple docstring"""






import math
from collections.abc import Callable






def        snake_case_  (      A_					:		Callable[[float], float],				A_					:		float,				A_					:		float						):


       '''simple docstring'''





       _lowerCamelCase						:				float    			= xa
       _lowerCamelCase						:				float    			= xa
       while True:
              if x_n == x_na or function(A_						) == function(A_						):
                     raise ZeroDivisionError('''float division by zero, could not find root'''						)
              _lowerCamelCase						:				float    			= x_na - (
                  function(A_						) / ((function(A_						) - function(A_						)) / (x_na - x_n))
              )
              if abs(x_na - x_na						) < 10**-5:
                     return x_na
              _lowerCamelCase						:				int    			= x_na
              _lowerCamelCase						:				List[Any]    			= x_na






def        snake_case_  (      A_					:		float						):


       '''simple docstring'''





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


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






'''simple docstring'''
# Algorithm for the pigeonhole sorting







def 					a__       (					lowerCAmelCase__						)    ->	Optional[Any]:
    UpperCAmelCase__			:		Any													=				min(lowerCAmelCase__						)  # min() finds the minimum value
    UpperCAmelCase__			:		Optional[int]													=				max(lowerCAmelCase__						)  # max() finds the maximum value

    UpperCAmelCase__			:		int													=				max_val - min_val + 1  # size is difference of max and min values plus one

    # list of pigeonholes of size equal to the variable size
    UpperCAmelCase__			:		Any													=				[0] * size

    # Populate the pigeonholes.
    for x in a:
        assert isinstance(lowerCAmelCase__  ,					lowerCAmelCase__						), "integers only please"
        holes[x - min_val] += 1

    # Putting the elements back into the array in an order.
    UpperCAmelCase__			:		Optional[int]													=				0
    for count in range(lowerCAmelCase__						):
        while holes[count] > 0:
            holes[count] -= 1
            UpperCAmelCase__			:		Dict													=				count + min_val
            i += 1





def 					a__       (					)    ->	Union[str, Any]:
    UpperCAmelCase__			:		List[str]													=				[8, 3, 2, 7, 4, 6, 8]
    pigeonhole_sort(lowerCAmelCase__						)
    print('''Sorted order is:'''  ,					''' '''.join(lowerCAmelCase__						)						)


if __name__ == "__main__":
  main()
