home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.programming
- Path: sparky!uunet!cs.utexas.edu!uwm.edu!moci!joeb
- From: joeb@moci.uucp (Joe Bronikowski (Little Joe))
- Subject: Re: Finding integer square root
- Organization: ICOM, Inc., West Allis, WI
- Date: Mon, 27 Jul 92 19:22:23 GMT
- Message-ID: <1992Jul27.192223.5741@moci.uucp>
- Summary: recommend Embedded Systems Programming magazine
- References: <1992Jul24.071704.6698@matilda.vut.edu.au>
- Lines: 36
-
- In article <1992Jul24.071704.6698@matilda.vut.edu.au> martin@matilda.vut.edu.au (Martin Schweitzer) writes:
- >I'm looking for an efficient algorithm that will find the highest integer
- > x such that x * x < n for some given integer n.
- >
- >Of course there are some brute force methods, but I seem to
- >recall coming across an algorithm once in a text about
- >proving correctness.
- >
- >Martin
-
- I suggest looking in back issues of _Embedded Systems Programming_, a monthly
- magazine. A long series of articles by Jack Crenshaw goes into excruciating
- detail in developing simple, fast, reliable algorithms for square roots,
- tangential functions, etc., with integer and floating-point examples. It makes
- VERY interesting reading. If you can't find this magazine in Austrailia,
- you can contact them at:
-
- Embedded Systems Programing
- Miller Freeman, Inc.
- 600 Harrison St.
- San Francisco, CA 94107
- 1-800-950-0523
-
- (ISSN 100-3272, if you need it)
-
- If you can't get the info any other way, mail me and I'll type in the
- algorithm you need. I strongly recommend reading the articles though,
- since the algorithm development is so neat :-)
-
- By the way, this magazine gives out free subscriptions to engineers/programmers
- in the embedded control field, so you might ask for a subscription
- qualification form.
- --
- // |------+---, Joe Bronikowski
- \\ // | | ) ICOM, Inc.
- \X/ |------+---' ...!uwm.edu!moci!joeb
-