Search found 1 match

by danaj
Tue Nov 22, 2016 1:23 am UTC
Forum: Coding
Topic: Efficiency of prime sieve
Replies: 7
Views: 6911

Re: Efficiency of prime sieve

There are at least three different topics here: 1. Compute primes less than n. The fastest algorithm is a well-optimized segmented Sieve of Eratosthenes, and the fastest implementation is primesieve as lorb pointed out. While missing lots of optimizations used in more production code, he has a nice ...

Go to advanced search