As you can see, the Bisection Method converges to a solution which depends on the tolerance and number of iteration the algorithm performs. There is a dependency between the tolerance and number of iterations. For a particular tolerance **we can calculate how many iterations n we need to perform**.

Every iteration the algorithm generates a series of intervals *[an, bn]* which is half of the previous one: