Xref: utzoo comp.lang.c:30729 comp.unix.questions:24244
Newsgroups: comp.lang.c,comp.unix.questions
Path: utzoo!utgpu!cunews!bcars8!bnrgate!bcarh342!mleech
From: mleech@bcarh342.bnr.ca (Marcus Leech)
Subject: Implementation of pow(3m) function
Message-ID: <1990Aug2.120706.25713@bnrgate.bnr.ca>
Keywords: math-library exponentiation C
Sender: news@bnrgate.bnr.ca (USENET News Administration)
Organization: Bell-Northern Research, Ltd. Ottawa Ontario CANADA
Date: Thu, 2 Aug 90 12:07:06 GMT

I recently received a complaint from a user about the CPU-hungriness
  of the pow(3m) function in the UNIX C library.
I'm wondering about the efficiency of "standard" implementations of this
  (and other) math library functions for C.  Does pow(3m) conventionally
  use a logarithm table, or is it (ugh!) iterative, or some B.O.T?
-----------------
Marcus Leech, 4Y11             Bell-Northern Research  |opinions expressed
mleech@bnr.ca                  P.O. Box 3511, Stn. C   |are my own, and not
VE3MDL@VE3JF.ON.CAN.NA         Ottawa, ON, CANADA      |necessarily BNRs