| Author |
Comment/Response |
Patrick
|
 01/06/12 10:47pm
I'm running a test where I'm comparing the speed of prime-finding algorithms against each other and against PrimeQ. PrimeQ obviously caches results:
Timing[PrimeQ[superlongnumber]][[1]]
=> 0.013356
Timing[PrimeQ[superlongnumber]][[1]]
=> 0.00006
How can I disable this so PrimeQ doesn't execute amazingly fast? Even better, how can I make my algorithms do this too?
URL: , |
|
