pe 3

gistfile1.txt

{-
In Haskell
-}

primeFactors n = recur 2 [] n
  where
  recur divisor facs limit
   | divisor > limit = facs
   | limit `mod` divisor == 0 = recur divisor (divisor:facs) (limit `div` divisor)
   | otherwise = recur (divisor+1) facs limit


// In Javascript

module.exports = primeFactors

function primeFactors(n) {
	var limit = n, divisor = 2, facs = []
	while(divisor <= limit) {
		if(limit % divisor === 0) {
			facs.push(divisor)
			limit = limit / divisor
		} else {
			++divisor
		}
	}
	return facs
}