View Single Post
Old 2010-10-02, 12:52   #8
Just call me Henry
henryzz's Avatar
Sep 2007
Cambridge (GMT)

22×1,423 Posts

Originally Posted by mdettweiler View Post
For you geekheads out there who understand Big-O notation, ppsieve is O((nmax-nmin)/log2(p/kmax)) and sr2sieve is O(k_count*sqrt(nmax-nmin)).
Are you sure that the runtime for sr2sieve is not O(sqrt(k_count)*sqrt(nmax-nmin))? Doubling the number of ks in sr2sieve doesn't multiply the runtime by 2. I am pretty certain I have read sqrt(k_count) before.
henryzz is offline