> From: Ronald Luis Benvenutti <rsf5335@PRO.VIA-RS.COM.BR>
>
> Hi all:
>
> To solve the problem of SQRT calculation, I'm sending the following simpe
> routine I've been using for years.
[program deleted]
> 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 ?
>

It's OK, but a bit slow.  Worst/average case is about 2**8/2**7
iterations which is way over to 150 or so cycles needed for the other
algorithms presented.  However, being simpler it probably takes up a
bit less ROM space.  Why don't you code it up in snappy PIC assembler?

Regards,
SJH
Canberra, Australia