Horje
prime factorization javascript Code Example
prime factorization javascript
function primeFactors(n){
  var factors = [], 
      divisor = 2;

  while(n>2){
    if(n % divisor == 0){
       factors.push(divisor); 
       n= n/ divisor;
    }
    else{
      divisor++;
    }     
  }
  return factors;
}
prime factorization javascript
function primeFactors(n){
  var factors = [], 
      divisor = 2;
  
  while(n>=2){
    if(n % divisor == 0){
       factors.push(divisor); 
       n= n/ divisor;
    }
    else{
      divisor++;
    }     
  }
	//contains duplicates, you should Array.prototype.filter() them out
  return factors;
}




Javascript

Related
MIN_SAFE_INTEGER Code Example MIN_SAFE_INTEGER Code Example
how to prepare key in object dyamically javascript Code Example how to prepare key in object dyamically javascript Code Example
ngmodel change Code Example ngmodel change Code Example
express timeout between requests Code Example express timeout between requests Code Example
copyright js Code Example copyright js Code Example

Type:
Code Example
Category:
Coding
Sub Category:
Code Example
Uploaded by:
Admin
Views:
8