prime no best

by amrendra kumar

JavaScript

function* getPrimes(n) {

  for (let i = 2; i <= n; i++) {
    let j
    for (j = 2; j < i / 2; j++) {
      if (i % j === 0) {
        break;
      }
    }
    if (j > i / 2) {
      yield i;
    }

  }
}

let res = [];
let gen = getPrimes(20);
for (let i = 0; i < 20; i++) {
  let val = gen.next().value;
  if (val == undefined)
    break;
  res.push(val);
}

console.log(res)