Re: Looking for the fastest Haskell primes algorithm

15 Apr
2009
15 Apr
'09
6:25 a.m.
for the API design, always check others before rolling your own. E.g. the (three) functions with "Prime" in their name from http://java.sun.com/javase/6/docs/api/java/math/BigInteger.html I hope they are there for a reason. While we're at it - do we have modPow? modInverse? And of course check their implementation as well (should be straightforward, but you never know). J.W.
5881
Age (days ago)
5881
Last active (days ago)
0 comments
1 participants
participants (1)
-
Johannes Waldmann