Rob Basler le escribe a All:

RB> I need an algorithm for calculating square roots to 3 or 4
RB> decimal places.  It must be fast, I don't care about

From C_ECHO, author cut off so that it would compile, but it was PD, anyway :):

/* ISqrt (I) computes INT (SQRT (I)), that is, the integral part of the */
/* square root of integer I. It does not check for negative arguments.  */
/* For all arguments 0..MaxInt the correct result is returned. The      */
/* algorithm exploits the following property:                           */
/*          n                                                           */
/*  n**2 =  Sigma (2i-1)                                                */
/*          i=1                                                         */

int ISqrt(int i)
{
  asm {
    mov   cx,i   ; load argument
    mov   ax,-1  ; init result
    cwd          ; init odd numbers to -1
    xor   bx,bx  ; init perfect squares to 0
{at}loop:
    inc   ax     ; increment result
    add   dx,2   ; compute next odd number
    add   bx,dx  ; next perfect square
    cmp   bx,cx  ; perfect square > argument ?
    jbe   {at}loop  ; until square greater than argument
  }
}

loSmaH cha'

--- timEd-B9