Prime Numbers in [1, n] The naive method takes O(n^1.5)) time. We could use the famous Sieve of Eratosthenes algorithm.

## Prime Numbers

Posted on

Skip to content
# Month: August 2020

## Prime Numbers

Prime Numbers in [1, n] The naive method takes O(n^1.5)) time. We could use the famous Sieve of Eratosthenes algorithm.

LeBlancâ€™s law: "Later equals never".

Posted on