In this paper, we propose a three step iteration process and analyze the performance of the process for a contractive-like operators. It is observed that this iterative procedure is faster than several iterative methods in the existing literature. To support the claim, a numerical example is presented using Maple 13. Some images are generated by using this iteration method for complex cubic polynomials. We believe that our presented work enrich the polynomiography software.