搜索素数

searchPrimes.js

var primes = [];
for(var i = 3; i < 10; i++){
  var noFactor = true;
  //console.log('i = ', i);
  for(var factor = 2; factor < i; factor++){
    //console.log('factor = ', factor);
    // check whether it has factor
    if(i % factor == 0){
      noFactor = false;
      break;
    }
  }
  if(noFactor)
    primes.push(i);
}
//display primes
console.log(primes);