We apply a coctel of elementary methods to the problem of finding the roots of an arbitrary polynomial. Specifically, we combine properties of the iteration z → z2 + c with rudimentary Galois theory in order to justify an algorithm to find the roots of a complex polynomial.