prime_factorization.hs

-- prime factorization
-- definitely needs improvement :X
 
getPrimeFactor :: Integer -> [Integer] -> (Integer, Integer)
getPrimeFactor n (p:ps) | n `mod` p == 0 = (p, (n `div` p))
                        | otherwise = getPrimeFactor n ps
 
getPrimeFactors :: Integer -> [Integer] -> [Integer]
getPrimeFactors n s | not (result == 1) = factor : getPrimeFactors result s
                    | otherwise = [factor]
                    where
                        (factor, result) = getPrimeFactor n s