Algorithm to find the square root of a number?

Question

The only algorithm I know for this problem is Newton's method (make an assumption and then improve it until it becomes good enough).

Any other ideas (use whatever language you prefer)

PS: Of course, I have no precedent for this, I just study it for academic reasons.

Answer 1

There is always a John Carmack method , which is a highly efficient version of the Newton method.

Answer 2

Here you can find a few.

Answer 3

.

C 2 Newton:

double sqrt(const double x)  
{
  union
  {
    int i;
    double x;
  } u;

  u.x = x;
  u.i = (1<<29) + (u.i >> 1) - (1<<22); 
  return u.x;
}