sieve of eratosthenes
function solution(n) {
const numArr = new Array(n + 1);
numArr.fill(true);
// from 1 to n, if number is NOT a prime, change true to false in numArr
numArr[0] = numArr[1] = false;
for (let i = 2; i <= Math.sqrt(n); i++) {
for (let j = 2; i * j <= n; j++) {
numArr[i * j] = false;
}
}
// find number of true(number of prime) by filtering true boolean
return numArr.filter(Boolean).length;
}sieve of eratosthenes
function solution(n) {
const numArr = new Array(n + 1);
numArr.fill(true);
numArr[0] = numArr[1] = false;
for (let i = 2; i <= Math.sqrt(n); i++) {
for (let j = 2; i * j <= n; j++) {
numArr[i * j] = false;
}
}
return numArr.filter(Boolean).length;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
