#bisection

To minimize a convex, differentiable $f$ on $[a, b]$ with $b - a = 1$, a bisection line search looks at the sign of $f'$ at the midpoint and keeps the half that contains the minimum. How many steps until the interval is shorter than $10^{-6}$?