php - Using forEach Loop Generating prime number in Javascript between 1 to 50

Question

682 votes

4 answers

php - Using forEach Loop Generating prime number in Javascript between 1 to 50

Get the solution ↓↓↓

Undefined answered · Answer 1 · 2022-02-9

Answer

Solution:

This is probably a too-advanced answer for a homework of this level, but technically it follows the rules (use Array.forEach) and it works.

Theprimes() generates new primes based on previous primes. So it won't test the reminder of all integers, thus more effecient. There are several arrow function uses, too, to keep things short. If you indeed use this answer, please try to read the relevant documentations and learn:

Seriously, try to think step-by-step. That's how you learn anything.

function* primes() {
  const previous = [];

  for (let i = 2; true; i++) {
    let isPrime = true;
    for (let p of previous) {
      if (i % p === 0) {
        isPrime = false;
        break;
      }
    }
    if (isPrime) {
      previous.push(i);
      yield i;
    }
  }
}

function* takeUntil(cb, iter) {
  for (let val of iter) {
    if (cb(val)) {
      return;
    }
    yield val;
  }
}

function showArrayIn(arr, container) {
  arr.forEach(p => container.innerHTML += `${p},<br/>`); // technically, we used Array.forEach.
}

showArrayIn(
  // get the prime number array declarativly 
  Array.from(takeUntil(n => n >= 50, primes())),
  // show in the container specified
  document.getElementById("results")
);

Primes:
<div id="results"></div>

Undefined answered

2022-02-9

Link to answer

66

votes

Answer

Solution:

function primeFactorsTo(max)
{
    var store  = [], i, j, primes = [];
    for (i = 2; i <= max; ++i) 
    {
        if (!store [i]) 
          {
            primes.push(i);
            for (j = i << 1; j <= max; j += i) 
            {
                store[j] = true;
            }
        }
    }
    return primes;
}

console.log(primeFactorsTo(5));

console.log(primeFactorsTo(15));

Undefined answered

2022-02-9

Link to answer

526

votes

Answer

Solution:

I Think so this is the correct answer which i deserve.. It is code lover short and aggressive

function primes(limit)
{
  var prime=[], i=1;
  while (++i < limit+1) prime.reduce((a,c)=>(i%c)*a,1) && prime.push(i);
  prime.unshift(2);
  return prime;
}
[50].forEach(n=>document.getElementById('foreach').innerHTML=(`${primes(n)}`));

Undefined answered

2022-02-9

Link to answer

169

votes

Answer

Solution:

Consider the following example.

function isPrime(num) {
  if (num === 1) {
    return false;
  } else if (num === 2) {
    return true;
  } else {
    for (var x = 2; x < num; x++) {
      if (num % x === 0) {
        return false;
      }
    }
    return true;
  }
}

function shown(n) {
  var list = [];
  for (var i = 1; i <= n; i++) {
    list.push(i);
  }
  list.slice().reverse().forEach(function(n, k, o) {
    if (!isPrime(n)) {
      list.splice(o.length - 1 - k, 1);
    }
  });
  document.getElementById("show").innerHTML = list;
}

shown(50);

Prime: <p id="show"></p>

Undefined answered

2022-02-9

Link to answer

Source

Share

Didn't find the answer?

Our community is visited by hundreds of web development professionals every day. Ask your question and get a quick answer for free.

Ask a Question

Answer

Solution:

function primeFactorsTo(max)
{
    var store  = [], i, j, primes = [];
    for (i = 2; i <= max; ++i) 
    {
        if (!store [i]) 
          {
            primes.push(i);
            for (j = i << 1; j <= max; j += i) 
            {
                store[j] = true;
            }
        }
    }
    return primes;
}

console.log(primeFactorsTo(5));

console.log(primeFactorsTo(15));

Undefined answered · Answer 3 · 2022-02-9

Answer

Solution:

I Think so this is the correct answer which i deserve.. It is code lover short and aggressive

function primes(limit)
{
  var prime=[], i=1;
  while (++i < limit+1) prime.reduce((a,c)=>(i%c)*a,1) && prime.push(i);
  prime.unshift(2);
  return prime;
}
[50].forEach(n=>document.getElementById('foreach').innerHTML=(`${primes(n)}`));

Undefined answered · Answer 4 · 2022-02-9

Answer

Solution:

Consider the following example.

function isPrime(num) {
  if (num === 1) {
    return false;
  } else if (num === 2) {
    return true;
  } else {
    for (var x = 2; x < num; x++) {
      if (num % x === 0) {
        return false;
      }
    }
    return true;
  }
}

function shown(n) {
  var list = [];
  for (var i = 1; i <= n; i++) {
    list.push(i);
  }
  list.slice().reverse().forEach(function(n, k, o) {
    if (!isPrime(n)) {
      list.splice(o.length - 1 - k, 1);
    }
  });
  document.getElementById("show").innerHTML = list;
}

shown(50);

Prime: <p id="show"></p>

Undefined answered

2022-02-9

Link to answer

Source

Share

Didn't find the answer?

Our community is visited by hundreds of web development professionals every day. Ask your question and get a quick answer for free.

Ask a Question

Popular technologies

Latest questions:

php - Using forEach Loop Generating prime number in Javascript between 1 to 50

Answer

Answer

Solution:

Answer

Solution:

Answer

Solution:

Share

Didn't find the answer?

Similar questions