Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- var isPrime = function(num2, memo){
- if(memo==void 0) memo = {};
- if(memo[num2]) return true;
- var bool = true;
- for(var i = Math.floor(Math.sqrt(num2)); i > 1; i--){
- if(num2 % i === 0){
- bool = false;
- }
- }
- if (bool) memo[num2] = true;
- return bool;
- };
- var largestPrimeFactor = function(num){
- var arr = [], primes = {};
- for(var j = Math.floor(num/2); j > 1 ; j--){
- if(isPrime(j, primes) === true && num % j === 0){
- return j;
- }
- }
- return num;
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement