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

minor refactor and comments

Browse Source
This commit is contained in:
Victoria Lo
2020-10-15 04:33:10 -07:00
parent d90e6d2e2d
commit 11dcd8d22b
1 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
Project-Euler/Problem7.js
View File

@ -2,22 +2,21 @@
const num = 10001; const num = 10001;
let primes = [2,3,5,7,11,13]; let primes = [2,3,5,7,11,13]; // given list of primes you start with
const calculatePrime = (num) => { const calculatePrime = (num) => {
let count = primes.length; let count = primes.length; // count number of primes calculated
let current = primes[count-1] + 1; let current = primes[count-1] + 1; // current number being assessed if prime
while (count < num) { 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 // go through each prime and see if divisible by the previous primes
let prime = false; let prime = false;
primes.some((n, i) => { primes.some((n, i) => {
if (current % n !== 0) { if (current % n === 0) {
if (i === count-1) {
prime = true;
}
} else {
return true; return true;
} }
if (i === count-1) {
prime = true;
}
}) })
if (prime) { if (prime) {
primes.push(current); primes.push(current);