algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 16:26:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

added more comments and standardized code

Browse Source
This commit is contained in:
Victoria Lo
2020-10-15 04:46:54 -07:00
parent 11dcd8d22b
commit 1596012d82
1 changed files with 16 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
Project-Euler/Problem7.js
View File

@ -1,30 +1,31 @@
// https://projecteuler.net/problem=7
// My approach does not use the Sieve of Eratosthenes but that is another common way to approach this problem. Sieve of Atkin is another possibility as well.
const num = 10001;
let primes = [2,3,5,7,11,13]; // given list of primes you start with
const num = 10001
const primes = [2, 3, 5, 7, 11, 13] // given list of primes you start with
const calculatePrime = (num) => {
let count = primes.length; // count number of primes calculated
let current = primes[count-1] + 1; // current number being assessed if prime
// Calculate each next prime by checking each number to see what it's divisible by
let count = primes.length // count number of primes calculated
let current = primes[count - 1] + 1 // current number being assessed if prime
while (count < num) { // repeat while we haven't reached goal number of primes
// go through each prime and see if divisible by the previous primes
let prime = false;
let prime = false
primes.some((n, i) => {
if (current % n === 0) {
return true;
return true
}
if (i === count - 1) {
prime = true;
prime = true
}
})
if (prime) {
primes.push(current);
count += 1;
if (prime) { // if prime, add to prime list and increment count
primes.push(current)
count += 1
}
current += 1;
current += 1
}
return primes[num-1];
return primes[num - 1]
}
console.log(calculatePrime(num));
console.log(calculatePrime(num))