TIP: Click on subject to list as thread! ANSI
echo: os2prog
to: David Noon
from: Jonathan de Boyne Pollard
date: 1995-12-27 15:03:12
subject: Cube root

DN>
  > From the foregoing, I would conclude that implemnters of C/C++ do not
  > use exp(log()) any longer for coding pow(). Instead, they use some
  > more specialised algorithm, possibly with special cases for [small]
  > integer roots.
DN>

  The commentary in \BCOS2\SOURCE\RTL\COMMON\POW.ASM is too long to post
  here, but reading it will reveal that Borland uses two separate
  algorithms for implementing the pow() function (one of which is an
  optimisation for powers of integers), along with a handful of code to
  handle some special cases.

  > JdeBP <
___
 X MegaMail 2.10 #0:

--- Maximus/2 3.00
* Origin: DoNoR/2,Woking UK (44-1483-725167) (2:440/4)
SEEN-BY: 270/101 620/243 711/401 409 410 413 430 808 809 934 955 712/407 515
SEEN-BY: 712/517 628 713/888 800/1 7877/2809
@PATH: 440/4 141/209 270/101 712/515 711/808 809 934

SOURCE: echomail via fidonet.ozzmosis.com

Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.