[REBOL] Re: Speed testing prime functions..
From: tomc:darkwing:uoregon at: 28-Nov-2001 12:59
Hi James, how small or lower order? how often will you need to call it? my argument against seive / brute force methods is you end up gaining information about numbers along the way that you may not have any use for. if your largest prime is small enough you could try loading or generating a list of primes and do a binary search (or just use find) On Thu, 29 Nov 2001, James Marsden wrote: