On Monday, 95/12/11, George White wrote to David Noon about "Cube
root" as follows:

GW> DN>took about 40% less time than using pow(). I think that pow() is
GW> DN>implemented in the BCAF 3.1 run-time as exp(log()) without any further
GW> DN>thought on Borland's part.
GW> 
GW> I've just looked, its coded in assembler in the run time library
GW> source.

Hi George,

I just took a look at the source too. It is in assembler, but it uses
2**(y*LOG2(x)) in order to evaluate x**y; almost as inefficient as
EXP(y*LN(x)).

Regards

Dave


 * KWQ/2 1.2i * Intel: If you want the right answer use a slower machine.

--- Maximus/2 3.00