Hi! |
A|A
(n n)
\_/
Maarten ter Huurne ([EMAIL PROTECTED]) replied about my prime
number program:
> (...) In fact, you only have to check until SQR(X) (...)
Yep, you are right. But I didn't say it was the best code
I could think of, but the fastest. SQR in MSX is calculated by
a numerical approximation (Newton method, if I remember right -
"The MSX Red Book" has it explained), what uses to take a lot
of time. Of course, if you had a very good math coprocessor,
with built-in square-root function, what is not the case with
MSX, you could really have the fastest code AND the best code...
Hmm, maybe someone could implement an FPU to MSX? A hardwired
one, please, or those are no long produced?
... Cyberknight...
<Stand by>
****
MSX Mailinglist. To unsubscribe, send an email to [EMAIL PROTECTED] and put
in the body (not subject) "unsubscribe msx [EMAIL PROTECTED]" (without the
quotes :-) Problems? contact [EMAIL PROTECTED] (www.stack.nl/~wiebe/mailinglist/)
****
