Peter J. Holzer
27b131c982
This is already a slightly optimized version: I hardcode 2 and compute only odd primes and I skip multiples of lesser primes in the inner loop. This roughly matches the algorithm used by Dave Plummer in his Youtube series. Just to have the same baseline |
||
---|---|---|
eratosthenes_parallel.go |