chas@ssc-vax.UUCP (02/21/87)
Floating point coprocessors are nice, but integer math should always be faster if you don't need the precision. Does anyone have source for high speed integer math routines such as sqrt, sin, cos, or even atan? I know that Turbo Pascal claims to have an integer sqrt, but how about some trig? Has anyone actally implemented the binary nth root algorithm in last November's Byte? How about for the specific case of square roots? It would be nice to find a routine that returns a 16bit square root of a 32bit number. I am running 68000 assembler, but I would like to see algorithms in any form available. I will summarize if I get some useful routines. Thanks in advance `oh great multi-headed organism', and may the fruits of your wisdom rain down upon me, Chas. -- UUCP (uw-beaver|fluke)!ssc-vax!ssc-bee!chas (Charles Boyd) ARPA ssc-vax!ssc-bee!chas@uw-beaver WORK (206) 773-3878 Now is the time for all good men to HOME (206) xxx-xxxx come to the aid of their planet...