使用比此更简单的代码将素数从2计数到100

Ruf*_*oLJ 0 javascript primes

它必须只有函数,变量,循环等(基本的东西).从目前为止我学到的东西(从应该能够做到)开始,我无法从头开始编写代码.让我真的很生气:/.如果你能一步一步地给我,以确保我明白我真的很感激.先谢谢了一大堆.

如何使用比这个更简单的代码获得相同的结果:

var primes=4; 
for (var counter = 2; counter <= 100; counter = counter + 1)
{
    var isPrime = 0;
    if(isPrime === 0){ 
        if(counter === 2){console.log(counter);} 
        else if(counter === 3){console.log(counter);} 
        else if(counter === 5){console.log(counter);} 
        else if(counter === 7){console.log(counter);} 
        else if(counter % 2 === 0){isPrime=0;} 
        else if(counter % 3 === 0){isPrime=0;} 
        else if(counter % 5 === 0){isPrime=0;} 
        else if(counter % 7 === 0){isPrime=0;}
        else {
            console.log(counter);
            primes = primes + 1;
        }
    }
}
console.log("Counted: "+primes+" primes");
Run Code Online (Sandbox Code Playgroud)

Ara*_*and 7

我今天感觉很顽皮:

function printPrimesBetweenTwoAndOneHundredSimply(){

   var primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97],
   i,
   arrayLength = primes.length;

   for(i = 0; i < arrayLength; i++){
     console.log(primes[i]);
   }

   console.log("Counted: " + arrayLength + " primes");
}
Run Code Online (Sandbox Code Playgroud)