Javascript Algorithm Number Prime Factorization

Introduction

Prime factorization is the process of determining which prime numbers multiply to a given number.

Given 10, it would print 5 and 2. 

function primeFactors(n){ 
        // Print the number of 2s that divide n 
        while (n%2 == 0) { 
            console.log(2); //w  ww  .j  a v a 2 s.  co m
            n = n/2; 
        } 

         // n must be odd at this point. So we can skip one element  
           (Note i = i +2) 
        for (var i = 3; i*i <= n; i = i+2) { 
            // While i divides n, print i and divide n 
            while (n%i == 0) { 
                console.log(i); 
                n = n/i; 
            } 
        } 
        //  This condition is to handle the case when n is a prime number 
        //  greater than 2 
        if (n > 2) { 
                console.log(n); 
        } 
} 
primeFactors(10); // prints '5' and '2'



PreviousNext

Related