Re: A89: TI-GCC
[Prev][Next][Index][Thread]
Re: A89: TI-GCC
The only one I have seen is this:
unsigned short sqrt(unsigned long a){
unsigned long rem = 0;
unsigned long root = 0;
for(int i=0; i> 30));
a <<= 2;
root ++;
if(root <= rem){
rem -= root;
root++;
}
else
root‹;
}
return (unsigned short)(root >> 1);
}
Zane Tian wrote:
>
> Hi =) I'm looking to use the TI-GCC compiler, but the last version didn't
> work on my computer... it gave me some "unable to copy blah.dll" error, and
> overall would not work on my computer. Does anyone know if the new version
> works? Ummm... I've got a 486 25 mHz laptop running windows 95. (is there
> something I need to fix as far as dos executables go, or what?)
>
> Help would be appreciated, cuz I want to start coding away ^_^ And oh...
> does anyone know a REALLY fast square root algorithm (like the ones built
> into the TI89 and TI92+ where it works for integers bigger than half a
> google....) If the code is in C++, all the better. All I really need is an
> algorithm, though. It's for the ETS's "bigint" class.
>
> Please? =)
> Zane.
> ______________________________________________________
> Get Your Private, Free Email at http://www.hotmail.com
--
Scott "_Wrath_" Dial
wrath@calc.org
ICQ#3608935
Member of TCPA - tcpa.calc.org
__________________________________________
NetZero - Defenders of the Free World
Get your FREE Internet Access and Email at
http://www.netzero.net/download/index.html
References: