We show that Bairstow's method is just one member of a family of similar algorithms for determining a quadratic factor of a polynomial. We suggest a way of choosing an appropriate member of this family for a particular problem. Numerical results indicate that our strategy compares favorably with the classical Bairstow algorithm.