int (int y) { int count = 0; for (int x = 0; x < size; x++) { double Zr = 0.0; double Zi = 0.0; double Cr = (x * fac - 1.5); double Ci = (y * fac - 1.0); int i = ITERATIONS; double ZrN = 0; double ZiN = 0; do { Zi = 2.0 * Zr * Zi + Ci; Zr = ZrN - ZiN + Cr; ZiN = Zi * Zi; ZrN = Zr * Zr; } while (!(ZiN + ZrN > LIMIT_SQUARED) && --i > 0); if (i == 0) count++; } return count; }