Haskell code by mohit_at_codepad - 13 lines

Link:

mohit_at_codepad - Haskell, pasted on Mar 15:

-- Written by Mohit Jain
-- Problem statement: Print all prime number in given range
main = showPrimeNumbersUpTo 4444 where
       showPrimeNumbersUpTo = putStrLn . unlines . printPrimes

printPrimes n = filterPrimesFromList twoToNList where
                twoToNList = takeWhile ( <= n ) ( 2 : [3,5..] )
                filterPrimesFromList = map show . removeNonPrimes

removeNonPrimes [] = []
removeNonPrimes (x:xs) = x : removeNonPrimes rem where
                         rem = filter nonZeroRem xs
                         nonZeroRem z = 0 /= z `mod` x

Output:

Create a new paste based on this one

Comments:

posted by mohit_at_codepad on May 30

Change removeNonPrimes to removeSomeComposites