Bisection method
The bisection method finds a root by repeatedly halving an interval whose endpoint function values have opposite signs and keeping a half that still brackets a root.
The bisection method finds a root by repeatedly halving an interval whose endpoint function values have opposite signs and keeping a half that still brackets a root.