**Unformatted text preview: **"sufficiently small," then declare victory. We are guaranteed to converge. We can even compute the maximum number of steps this will take. We know in advance how well we will approximate the root X* . These are very powerful facts, which make bisection a robust algorithm - that is, it is very hard to defeat it. Discussion : If we know the start points A and B and the interval size tolerance TOL , we can predict beforehand the number of steps the bisection code will (probably) take. What is this formula? Discussion : Name a function which has a root in the interval [-1, 1], but for which bisection could not be used....

View
Full
Document