Several months ago I wrote a treatment of an old algorithm for finding the
square root of an integer without using floating point numbers,
multiplication, or division. The method was an old one, and rather slow, so
I decided to come up with a comparable treatment of a more contemporary
algorithm. I finally finished it, so here it is, if anyone is interested.

www.bcpl.net/~jpower/fastsqrt.pdf

John Power

--
http://www.piclist.com hint: PICList Posts must start with ONE topic:
[PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads