The Brent method interpolates of f at three points, finds the intersection of the interpolation with the x axis, computes the sign of f at this point and chooses the interval where the sign changes. It is generically faster than bisection.
Example.
Input:
Output:
⎡ ⎣ | 0.739085133215 | ⎤ ⎦ |