Python coding question

The Bisection Method Be sure to watch the Bisection Method video before attempting this section! As we have seen, the Newton-Raphson Method is a very powerful way to solve an equation. However, like all numerical algorithms, it has its Achilles' heel (see this slide). One simple alternative root-finding algorithm that usually works well in situations where the Newton-Raphson Method fails is the Bisection Method The algorithm The basic idea of the Bisection Method is to bound the root within a lower bound and an upper bound. You then narrow the bounding interval progressively by evaluating the function at the middle of the interval and updating either the lower or the upper bound accordingly. Each iteration halves the bounding interval and you narrow-in on the root. a Initial range Narrower ringe Imid = left + right 2 f(x)