A number of methods that require only function evaluation to find a bracketed root are discussed. The Snyder, Pegasus, and Anderson-Bjorck schemes of Regula Falsi type converge superlinearly, but all use relatively slow secant steps. Two recent methods are faster because they exploit the rational interpolation step used by Anderson and Bjorck, and virtually eliminate secant steps.