The zero theorem guarantees that a solution exists, but not where: numerical algorithms find it by successive approximations. Bisection halves the interval at each step (robust but slow); the Newton-Raphson method uses the derivative to converge much faster (fast but delicate).