Re: A85: Routines

To: assembly-85@lists.ticalc.org
Subject: Re: A85: Routines
From: Humberto Yeverino <humberto@engr.csufresno.edu>
Date: Sun, 29 Mar 1998 19:42:30 -0800 (PST)
Delivered-To: assembly-85-outgoing@towerguard.unix.edu.sollentuna.se
In-Reply-To: <19980327.202051.4791.0.justin-b@juno.com>
Reply-To: assembly-85@lists.ticalc.org


On Fri, 27 Mar 1998, Justin M Bosch wrote:

> 
> >I posted a 16-bit square root routine a while back.
> >If you want to see it it's on my ti page:
> >www.engr.csufresno.edu/~humberto/tex.html
> 
> I haven't had a chance to study the code, although I briefly scanned over
> it.  Does it set the carry flag if it isn't a perfect square?  Thanks for
> your help.
>
No, that's just to divide a negative number by 2.  It rounds to the
nearest root ex: if the root was 4.51 the it would return 5. It does this
by checking each possible answer.  There are 257 possible answers but it
is so optimized that the worst case takes about .03 seconds.

-Humberto Yeverino Jr.

"Small potatos make the steak look bigger."

http://www.engr.csufresno.edu/~humberto/Home.html
humberto@engr.csufresno.edu

<font size=3>For browsers:<br>
<a href="http://www.engr.csufresno.edu/~humberto/Home.html">
Have a look.</a></font><br>

References:

Re: A85: Routines

From: justin-b@juno.com (Justin M Bosch)

Prev: A85: Example header for the compiler
Next: Re: A85: Temporary variables
Index(es):
- Main
- Thread