Quote:
Originally Posted by neutrino15
What is the advantage to using this vs a lookup table to the desired degree of accuracy?
How much more accurate and slow is the built in <math.h>?
|
Well, the math.h implementation can be called ~100 times per second (speed test that was posted on CD at some point this month), and this function takes a half second for 4500 calls (a half second being the max time a loop can execute before the OI says it 'crashed')
so id say its about... 90x faster?
someone call me on this if my math is wrong.