


from collections.abc import Callable




def  a   (lowerCAmelCase__		,				lowerCAmelCase__		,				lowerCAmelCase__   ):
   __a					=  a
   __a					=  b
   if function(lowerCAmelCase__   ) == 0:  # one of the a or b is a root for the function
      return a
   elif function(lowerCAmelCase__   ) == 0:
      return b
   elif (
       function(lowerCAmelCase__   ) * function(lowerCAmelCase__   ) > 0
   ):  # if none of these are root and they are both positive or negative,
      # then this algorithm can't find the root
      raise ValueError("""could not find root in given interval."""   )
   else:
      __a					=  start + (end - start) / 2.0
      while abs(start - mid   ) > 10**-7:  # until precisely equals to 10^-7
         if function(lowerCAmelCase__   ) == 0:
            return mid
         elif function(lowerCAmelCase__   ) * function(lowerCAmelCase__   ) < 0:
            __a					=  mid
         else:
            __a					=  mid
         __a					=  start + (end - start) / 2.0
      return mid




def  a   (lowerCAmelCase__   ):
   return x**3 - 2 * x - 5


if __name__ == "__main__":
  print(bisection(f, 1, 1_0_0_0))

  import doctest

  doctest.testmod()







def 			lowerCAmelCase__					(     a__:						Optional[int]			)    ->						Optional[int]:


							'''simple docstring'''





							_UpperCAmelCase											=     len(a__			)
							for i in range(length - 1			):
														_UpperCAmelCase											=     i
														for k in range(i + 1     ,    a__			):
																					if collection[k] < collection[least]:
																												_UpperCAmelCase											=     k
														if least != i:
																					_UpperCAmelCase						,			_UpperCAmelCase											=     (collection[i], collection[least])
							return collection


if __name__ == "__main__":
		lowerCAmelCase__    :List[str]       =				input('''Enter numbers separated by a comma:\n''').strip()
		lowerCAmelCase__    :Any       =				[int(item) for item in user_input.split(''',''')]
		print(selection_sort(unsorted))
