// the complex numbers used in the recursion equationComplex Zone[2];Complex P; // P is the point in the plane// Saving the values as a colorColor result[256][256];// Then define the area in the complex plane that should be rendered// The mandelbrot looks great in the interval:double start_x = -2.0;double end_x = 2.0;double start_y = -2.0;double end_y = 2.0;P.a = start_x; // the real part of P denoted as aP.b = start_y; // the imaginary part of P denoted as b// assigning the distance between each point (end - start = 4)double add = (4.0 / 256.0);// Starting a loop that goes through each of the 256*256 pointsfor(int x = 0; x < 256; x++){  for(int y = 0; y < 256;  y++)  {    //ok, a recursion equation is just basically a row of numbers    //where each of the numbers are a product or sum of some of    //the previous numbers and/or constants    //The mandelbrot fractal are generated out of a recursion    //equation where Z[n] = (Z[n-1])^2 + P, basically what this    //sayss is that each number is equal to the previous one in    //the row to the power of two plus P (P is the point in the    //plane)    //Since we dont have an infinite row of Z''s to use we just    //recycle the ones we declared earlier    //The key point of this is to check if therecursion    //converge or diverge, to do this we check up to Z[499],    //and if its absolute value is not greater than 2 then we    //can safely assume that it converges    Z[1].a = 0;    Z[1].b = 0;    bool converge = true;    for(int c = 0; (c < 500)&&(converge); c++)    {      Z[0] = Z[1]*Z[1] + P;            if(Z[0].abs() > 2.0) // .abs() returns the absolute value      {        converge = false;      }      // recycling      Z[1] = Z[0];    }    if(converge)    {      //if it converge you might want to multiply the color      //value to fit a special color format, as it is often < 1.0      result[x][y].blue = Z[0].abs();      result[x][y].red = 0.0;      result[x][y].green = 0.0;     }    else    {      //if it deverges you usually get very high values (even      //though it exits the loop the first timemits higher than 2      //so i usually divide it by a constant (100 in this case)      result[x][y].blue = 0.0;      result[x][y].red = Z[0].abs(); * 0.01;      result[x][y].green = Z[0].abs(); * 0.01;    }       // now changing P so its ready for the next screen coordinate:    P.a += add;  }  P.b += add;  P.a = start_x;}// the next thing to do is to draw/save the color values in the// "result" array  

    class Complex {public:	Complex( double ar = 0.0, double bi = 0.0 );	double absl( void );	double argu( void );	Complex conjugate( void );	Complex inverse( void );	Complex root( void );	Complex operator+( Complex &right );	Complex operator-( Complex &right );	Complex operator*( Complex &right );	Complex operator/( Complex &right );	Complex operator+( double  right );	Complex operator-( double  right );	Complex operator*( double  right );	Complex operator/( double  right );	void operator+=( Complex &right );	void operator-=( Complex &right );	void operator*=( Complex &right );	void operator/=( Complex &right );	void operator+=( double  right );	void operator-=( double  right );	void operator*=( double  right );	void operator/=( double  right );	double a;	double b;	~Complex( void );};Complex::Complex( double ar, double bi){	a = ar;	b = bi;}double Complex::absl( void ){	return sqrt((a*a)+(b*b));}double Complex::argu( void ){	return asin(b/sqrt((a*a)+(b*b)));}Complex Complex::conjugate( void ){	Complex ret(a, -b);	return ret;}Complex Complex::inverse( void ){	double abt = (a*a)+(b*b);	if(abt > 0)	{		abt = 1.0 / abt;	}	Complex ret(a*abt,-b*abt);	return ret;}Complex Complex::root( void ){	Complex ret;	double arg = argu();	double rad = absl();	ret.a = sqrt(rad)*cos((2.0*PI + arg)/2.0);	ret.b = sqrt(rad)*sin((2.0*PI + arg)/2.0);	return ret;}Complex Complex::operator +( Complex &right ){	Complex ret( a + right.a, b + right.b );	return ret;}Complex Complex::operator -( Complex &right ){	Complex ret( a - right.a, b - right.b );	return ret;}Complex Complex::operator *( Complex &right ){	Complex ret( ((a*right.a)-(b*right.b)), ((a*right.b)+(b*right.a)) );	return ret;}Complex Complex::operator /( Complex &right ){	Complex ret;	ret.a = ((a*right.a)+(b*right.b))/((right.a*right.a)+(right.b*right.b));	ret.b = ((b*right.a)+(a*right.b))/((right.a*right.a)+(right.b*right.b));	return ret;}Complex Complex::operator +( double right ){	Complex ret((a+right), b);	return ret;}Complex Complex::operator -( double right ){	Complex ret((a-right), b);	return ret;}Complex Complex::operator *( double right ){	Complex ret((a*right), (b*right));	return ret;}Complex Complex::operator /( double right ){	Complex ret((a/right), (b/right));	return ret;}void Complex::operator +=( Complex &right ){	a += right.a;	b += right.b;}void Complex::operator -=( Complex &right ){	a -= right.a;	b -= right.b;}void Complex::operator *=( Complex &right ){	a = ((a*right.a)-(b*right.b));	b = ((a*right.b)+(b*right.a));}void Complex::operator /=( Complex &right ){	a = ((a*right.a)+(b*right.b))/((right.a*right.a)+(right.b*right.b));	b = ((b*right.a)+(a*right.b))/((right.a*right.a)+(right.b*right.b));}void Complex::operator +=( double right ){	a += right;}void Complex::operator -=( double right ){	a -= right;}void Complex::operator *=( double right ){	a *= right;	b *= right;}void Complex::operator /=( double right ){	a /= right;	b /= right;}Complex::~Complex( void ) { }    

          Color result[256][256];  it gives an "Unhandled Exception: Stack overflow"i have defined Color as      struct Color{	double red;	double green;	double blue;};