Talk:99 questions/Solutions/35

From HaskellWiki
Revision as of 12:02, 31 May 2011 by WillNess (talk | contribs) (New page: The last change to the code brought its complexity down to the theoretical one of trial division, as it should be, about O(n^1.45) empirically, in number of primes produced; previous versi...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The last change to the code brought its complexity down to the theoretical one of trial division, as it should be, about O(n^1.45) empirically, in number of primes produced; previous versions had it up there in O(n^1.67) or even O(n^1.85), which is what I've started from. WillNess 12:02, 31 May 2011 (UTC)