[Haskell-cafe] how to make haskell faster than python at finding primes?

Paulo Tanimoto tanimoto at u.arizona.edu
Mon Aug 6 04:23:50 EDT 2007

> The challenge was the implement the modcount algorithm not to calculate
> primes per se.
> (see e.g. http://jjinux.blogspot.com/2005/11/io-comparison.html).

Can you show us the Python code?


More information about the Haskell-Cafe mailing list