


def      a	(							SCREAMING_SNAKE_CASE_      :		float       ):






       """simple docstring"""





       return 1_0 - x * x


def      a	(							SCREAMING_SNAKE_CASE_      :		float							,			SCREAMING_SNAKE_CASE_      :		float       ):






       """simple docstring"""





       if equation(SCREAMING_SNAKE_CASE_       ) * equation(SCREAMING_SNAKE_CASE_       ) >= 0:
              raise ValueError('''Wrong space!'''       )

       UpperCamelCase    :	List[Any]   	=		a
       while (b - a) >= 0.01:
              # Find middle point
              UpperCamelCase    :	Any   	=		(a + b) / 2
              # Check if middle point is root
              if equation(SCREAMING_SNAKE_CASE_       ) == 0.0:
                     break
              # Decide the side to repeat the steps
              if equation(SCREAMING_SNAKE_CASE_       ) * equation(SCREAMING_SNAKE_CASE_       ) < 0:
                     UpperCamelCase    :	Optional[Any]   	=		c
              else:
                     UpperCamelCase    :	Tuple   	=		c
       return c


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  print(bisection(-2, 5))
  print(bisection(0, 6))





from __future__ import annotations


def      a	(							SCREAMING_SNAKE_CASE_      :		list[int]       ):






       """simple docstring"""





       if len(SCREAMING_SNAKE_CASE_       ) == 0:
              return array

       UpperCamelCase	, UpperCamelCase    :	Union[str, Any]   	=		min(SCREAMING_SNAKE_CASE_       ), max(SCREAMING_SNAKE_CASE_       )

       # Compute the variables
       UpperCamelCase    :	Union[str, Any]   	=		_max - _min + 1
       UpperCamelCase	, UpperCamelCase    :	Optional[Any]   	=		[0] * holes_range, [0] * holes_range

       # Make the sorting.
       for i in array:
              UpperCamelCase    :	Optional[int]   	=		i - _min
              UpperCamelCase    :	Any   	=		i
              holes_repeat[index] += 1

       # Makes the array back by replacing the numbers.
       UpperCamelCase    :	str   	=		0
       for i in range(SCREAMING_SNAKE_CASE_       ):
              while holes_repeat[i] > 0:
                     UpperCamelCase    :	List[Any]   	=		holes[i]
                     index += 1
                     holes_repeat[i] -= 1

    # Returns the sorted array.
       return array


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  __UpperCAmelCase : Any 			=				input("Enter numbers separated by comma:\n")
  __UpperCAmelCase : int 			=				[int(x) for x in user_input.split(",")]
  print(pigeon_sort(unsorted))

