Sieve of Eratosthenes

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

Code

Algorithms

const sieve = new Array(n + 1).fill(true);
sieve[0] = sieve[1] = false;
for (let i = 2; i * i <= n; i++) {
  if (sieve[i]) for (let j = i * i; j <= n; j += i) sieve[j] = false;
}
return sieve.map((v, i) => v ? i : -1).filter(i => i !== -1);

Parameters

n(number)

Upper limit

Browser·fetch() may be limited by CORS

More JavaScript Snippets

Binary to Decimal

Convert a binary string representation to its decimal number equivalent.

Bytes to Human Readable

Convert bytes to human readable format (KB, MB, GB, etc.) for file sizes.

Calculate Median

Calculate the median value of an array of numbers.

Calculate Mode

Find the most frequent value(s) in an array.

Calculate Percentile

Calculate the nth percentile of an array using linear interpolation.

Celsius to Fahrenheit

Convert temperature from Celsius to Fahrenheit using the standard formula.