Babylonian method for square root.

[coercedman66]

I'm trying to build a square root function to do square roots using the babylonian method, but getting the wrong result. I have the following code

        //base is the number being calculated, and is floating point.
	calc=base/2;//first estimate way off.
	last=0;
	while(last!=calc && check!=base)
	{
		last=calc;
		check=calc;
		calc=base/calc;
		calc=check+calc;
		calc/=2;
		check=calc*calc;

	}

[buffbill]

The Babalonian method of calculating the square root of 2 simply progressively averages the result from (x+2/x) where x is given some arbitrary value. The tolerance is applied to provide accuracy in this case to 7 decimal places

const double TOLERANCE = 5e-8;
    double x=7;
    
    while (fabs(x*x-2.0)>TOLERANCE)//absolute value function
    {
          cout<<x<<endl;
          x=(x+2.0/x)/2;
    }