News for hackers. Stuff that matters.
Re:Computing primes with CSS by contravariant on Friday September 30, 2016 @07:50AM (#12611889)
Well it's closer to O((n/log(n))^0.5), although that doesn't make much of a difference until n becomes rather large.
Re:Computing primes with CSS by mikejb on Friday September 30, 2016 @08:58AM (#12612160)
Good catch - I didn't differentiation between n as 'upper limit for primes' and n as 'input length'. The former is more intuitive, which makes your solution more accurate. (Also, I should have played it safe and use O instead of Θ...)