



'''simple docstring'''





from __future__ import annotations




def lowerCAmelCase    (__A):



     """simple docstring"""



     if len(__A) == 0:
          return []
     _a    ,       _a           =    min(__A), max(__A)
     _a           =    int(max_value - min_value) + 1
     _a           =    [[] for _ in range(__A)]

     for i in my_list:
          buckets[int(i - min_value)].append(__A)

     return [v for bucket in buckets for v in sorted(__A)]


if __name__ == "__main__":
  from doctest import testmod

  testmod()
  assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
  assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





'''simple docstring'''




import math
from collections.abc import Callable







def 						lowerCAmelCase_							(  snake_case__						,							snake_case__						,							snake_case__		):




    '''simple docstring'''



    A			:  float   =		xa
    A			:  float   =		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'''		)
        A			:  float   =		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
        A			:  Any   =		x_na
        A			:  Any   =		x_na







def 						lowerCAmelCase_							(  snake_case__		):




    '''simple docstring'''



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


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




