


'''simple docstring'''

def 							__magic_name__(  lowerCamelCase):
						return 1_0 - x * x

def 							__magic_name__(  lowerCamelCase, lowerCamelCase):
						# 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.01:
												# 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))








"""simple docstring"""
def      __lowerCamelCase   (							a_     :		int							)			->      bool:
      if not isinstance(a_ ,   a_							):
            __SCREAMING_SNAKE_CASE   :int						=  f'''Input value of [number={number}] must be an integer'''
            raise TypeError(a_							)
      if number < 0:
            return False
      __SCREAMING_SNAKE_CASE   :Any						=  number * number
      while number > 0:
            if number % 10 != number_square % 10:
                  return False
            number //= 10
            number_square //= 10
      return True


if __name__ == "__main__":
  import doctest

  doctest.testmod()