forked from SF-WDI-LABS/problem-set-js-basics
-
Notifications
You must be signed in to change notification settings - Fork 0
/
primes.js
32 lines (27 loc) · 856 Bytes
/
primes.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
/*
1. Create a function `isPrime(num)` that returns true if the number passed in is a prime number
and false if not.
2. Using your `isPrime` function, create a function `primes(max)` that will return an array of all
prime numbers up to, but not exceeding a max number.
Reading: http://stackoverflow.com/questions/439870/why-are-primes-important-in-cryptography
*/
// YOUR CODE HERE
function isPrime(num) {
// start at 2 since 0 and 1 are not prime numbers
for(var i = 2; i < num; i++) {
if(num % i === 0) {
return false;
}
}
return true;
}
// function to return array of all prime numbers up to max value
function primes(max) {
var primesArray = [];
for(var i = 2; i < max; i++) {
if(isPrime(i)) {
primesArray.push(i);
}
}
return primesArray;
}