Y
Hacker News
new
|
ask
|
show
|
jobs
by
abrudz
898 days ago
That's not Eratosthene's sieve, but rather a naive O(n²) algorithm, implementing "a prime never occurs in the multiplication table".