|
|
|
last edited 16 years ago by alfredo |
Edit detail for #341 'primes' seems to be slow revision 1 of 4
| 1 2 3 4 | ||
|
Editor:
Time: 2007/11/17 22:29:53 GMT-8 |
||
| Note: | ||
changed: - It seems that axiom's 'primes' function, returning the list of primes between two given numbers, is unnecessarily slow: \begin{axiom} )time on primes(1,1000000); \end{axiom} vs. http://groups.google.com/group/comp.lang.lisp/browse_thread/thread/614704678c627091/92efa3412b99c974?tvc=2&hl=en#92efa3412b99c974 Martin
It seems that axiom's primes function, returning the list of primes between two given numbers, is unnecessarily slow:
axiom
)time on
primes(1,1000000);
Type: List Integer
axiom
Time: 9.64 (EV) + 0.01 (OT) + 3.75 (GC) = 13.40 sec
vs.
Martin