Question

The root of an unknown function f (2) is to be found via bisection. The initial lower guess is 2 and the initial high guess is du = 8. The algorithm stops when the absolute value of the difference between the lower and upper guesses is less than 0.1. How many total iterations will be made? Assume f (21) and f (qu) have opposite signs.

Answer 1

$\varepsilon =\frac{x_u-x_l}{2^{n}}$

$0.1=\frac{8-2}{2^{n}}$

$n=5.906\sim 6$

No of iteration is 6