There was some discussion about prime number generators earlier this year:
http://www.haskell.org/pipermail/haskell-cafe/2007-February/022347.html
http://www.haskell.org/pipermail/haskell-cafe/2007-February/022699.html
You can find several sources there.
Met vriendelijke groet,
Henk-Jan van Tuyl
--
http://functor.bamikanarie.com
http://Van.Tuyl.eu/
--
On Sat, 14 Jul 2007 08:07:34 +0200, Hugh Perkins <[EMAIL PROTECTED]>
wrote:
If someone can provide an optimized version of the prime number
algorithm in
Haskell, I'll run it in both Haskell and C# and print the results. The
algorithm is a simple sieve of Eratosthenes (I think). This is basically
the kind of algorithm Haskell is built for ;-) so if it doesn't win this
it's go-home time ;-)
Well, until automatic threading arrives of course.
--
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
