Re: [Haskell-cafe] how to make haskell faster than python at finding primes?
6 Aug
2007
6 Aug
'07
4:09 a.m.
ptanimoto:
I haven't tried any of those codes, but Don did you notice you're calculating 1,000 primes while Alex was talking about 10,000?
Yeah, I tested both with 1k and 10k :)
6498
Age (days ago)
6498
Last active (days ago)
0 comments
1 participants
participants (1)
-
dons＠cse.unsw.edu.au