





'''simple docstring'''





def    __UpperCamelCase      (    a) ->float:
					return 10 - x * x





def    __UpperCamelCase      (    a,     a) ->float:
					# Bolzano theory in order to find if there is a root between a and b
					if equation(a) * equation(a) >= 0:
										raise ValueError("Wrong space!")

					lowerCamelCase__       =       a
					while (b - a) >= 0.0_1:
										# Find middle point
										lowerCamelCase__       =       (a + b) / 2
										# Check if middle point is root
										if equation(a) == 0.0:
															break
										# Decide the side to repeat the steps
										if equation(a) * equation(a) < 0:
															lowerCamelCase__       =       c
										else:
															lowerCamelCase__       =       c
					return c


if __name__ == "__main__":
						import doctest

						doctest.testmod()

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








def    __UpperCamelCase      (    a) ->str:

					if isinstance(a,     a):
										raise TypeError("'float' object cannot be interpreted as an integer")
					if isinstance(a,     a):
										raise TypeError("'str' object cannot be interpreted as an integer")

					if num == 0:
										return "0b0"

					lowerCamelCase__       =       False

					if num < 0:
										lowerCamelCase__       =       True
										lowerCamelCase__       =       -num

					lowerCamelCase__       =       []
					while num > 0:
										binary.insert(0,     num % 2)
										num >>= 1

					if negative:
										return "-0b" + "".join(str(a) for e in binary)

					return "0b" + "".join(str(a) for e in binary)


if __name__ == "__main__":
						import doctest

						doctest.testmod()

