Hi all:

To solve the problem of SQRT calculation, I'm sending the following simpe
routine I've been using for years.
The code is in C, but is easily convertible to PIC or another microcontroller.
This routine extracts a SQRT of a integer (16 bits), but can be easily converted
to more bits.

#include <stdio.h>
void main(void)
{
unsigned int n, odd, sqrt, sum;
clrscr ();
while (1)
        {
        printf("\nnumber : ");
        scanf("%d", &n);
        if (n == 0)
                return;
        sum = 0;                       //
        sqrt = 0;                      //
        odd = 1;                       //
        while (sum < n)                //  sqrt routine
                {                      //  input = 16 bits in n
                odd += 2;              //  output = result in sqrt
                sum += odd;            //
                sqrt++;                //
                }                      //
        printf("sqrt(%d) = %d", n, sqrt);
        }
}

The routine does the following:

It sums all odd numbers until the sum reaches the number 'n'. The number of
iterations
(sums) is the integer sqrt of 'n'.

Is there something so simple ?

I hope it can help.

======================================================================
Ronald Luis Benvenutti
Porto Alegre - RS - Brazil

rsf5335@via-rs.com.br
benvenut@conex.com.br
=======================================================================