I ran a few of the tests myself on my Mac Mini G4 with 512 Mb ram. I
compiled the programs with ghc 6.6. I got different results however.
10^310^410^5
Reinke 0.7251 1.751 1m0.310s
Runciman0.126 1.097 5m19.569s
Zilibowitz 0.07
*sigh* don't click send at 2:30am...
I wrote:
The algorithm named Naive in my table is called SimplePrimes in
the zip file, and the example named sieve in my table is called
NaivePrimes in the zip file.
The algorithm named Naive in my table is called SimplePrimes in the
zip file, and the
I see that there has been some discussion on the list about prime
finding algorithms recently. I just wanted to contribute my own
humble algorithm:
primes :: [Integer]
primes = primesFilter 1 [2..]
primesFilter :: Integer - [Integer] - [Integer]
primesFilter primorial (n:ns)
| (gcd
On 2/22/07, Ruben Zilibowitz [EMAIL PROTECTED] wrote:
I see that there has been some discussion on the list about prime
finding algorithms recently. I just wanted to contribute my own
humble algorithm:
[snip]
Comparing it to some of the algorithms in:
Ruben Zilibowitz wrote:
I see that there has been some discussion on the list about prime
finding algorithms recently. I just wanted to contribute my own
humble algorithm:
Thanks!
Comparing it to some of the algorithms in:
http://www.haskell.org/pipermail/haskell-cafe/2007-February/
