Am Dienstag 29 Dezember 2009 04:38:21 schrieb Will Ness: > Now _this_, when tested as interpreted code in GHCi, runs about 2.5x times > faster than Priority Queue based code from Melissa O'Neill's ZIP package > mentioned at the haskellwiki/Prime_Numbers page, with > about half used memory reported, in producing 10,000 to 300,000 primes. > > It is faster than BayerPrimes.hs from the ZIP package too, in the tested > range, at about 35 lines of code in total.
That's nice. However, the important criterion is how compiled code (-O2) fares. Do the relations continue to hold? How does it compare to a bitsieve?
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
