
def 						_snake_case(  SCREAMING_SNAKE_CASE__    )			->   float:
       return 10 - x * x







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

       lowercase							:					Optional[int]	     =				a
       while (b - a) >= 0.01:
              # Find middle point
              lowercase							:					Optional[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:
                     lowercase							:					str	     =				c
              else:
                     lowercase							:					List[str]	     =				c
       return c


if __name__ == "__main__":
  import doctest

  doctest.testmod()

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


def 						_snake_case(  SCREAMING_SNAKE_CASE__    )			->   int:
       assert (
           isinstance(SCREAMING_SNAKE_CASE__ ,     SCREAMING_SNAKE_CASE__    ) and number_of_steps > 0
       ), f"number_of_steps needs to be positive integer, your input {number_of_steps}"
       if number_of_steps == 1:
              return 1
       lowercase     ,      lowercase							:					Tuple	     =				1, 1
       for _ in range(number_of_steps - 1    ):
              lowercase     ,      lowercase							:					str	     =				current + previous, current
       return current


if __name__ == "__main__":
  import doctest

  doctest.testmod()
