Sieve of Eratosthenes

Generate all prime numbers up to n using the Sieve of Eratosthenes algorithm.

Code

Algorithms
$sieve = array_fill(0, $n + 1, true);
$sieve[0] = $sieve[1] = false;
for ($i = 2; $i * $i <= $n; $i++) {
    if ($sieve[$i]) {
        for ($j = $i * $i; $j <= $n; $j += $i) {
            $sieve[$j] = false;
        }
    }
}
array_keys(array_filter($sieve));

Parameters

Upper limit

Server

More PHP Snippets