mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-15 02:33:35 +08:00
e112434dee
* Add prettier config * test: add test to check for absolute function * chore: es5 to es6 * test: add test to check mean function * test: add test for sum of digit * test: add test for factorial * test: add test for fibonnaci * test: add test for find HCF * test: add test for lcm * test: add gridget test * test: add test for mean square error * test: add test for modular binary exponentiation * test: add tests for palindrome * test: add test for pascals triangle * test: add tests for polynomial * test: add tests for prime check * test: add tests for reverse polish notation * test: add tests for sieve of eratosthenes * test: add tests for pi estimation monte carlo method * chore: move tests to test folder * chore: fix standardjs errors
22 lines
578 B
JavaScript
22 lines
578 B
JavaScript
const sieveOfEratosthenes = (n) => {
|
|
/*
|
|
* Calculates prime numbers till a number n
|
|
* :param n: Number upto which to calculate primes
|
|
* :return: A boolean list contaning only primes
|
|
*/
|
|
const primes = new Array(n + 1)
|
|
primes.fill(true) // set all as true initially
|
|
primes[0] = primes[1] = false // Handling case for 0 and 1
|
|
const sqrtn = Math.ceil(Math.sqrt(n))
|
|
for (let i = 2; i <= sqrtn; i++) {
|
|
if (primes[i]) {
|
|
for (let j = 2 * i; j <= n; j += i) {
|
|
primes[j] = false
|
|
}
|
|
}
|
|
}
|
|
return primes
|
|
}
|
|
|
|
export { sieveOfEratosthenes }
|