missett/Haskell Sieve of Eratosthenes

Created December 21, 2013 15:13

Star () You must be signed in to star a gist
Fork () You must be signed in to fork a gist

Learn more about clone URLs
Clone this repository at <script src="https://gist.github.com/missett/8070630.js"></script>
Save missett/8070630 to your computer and use it in GitHub Desktop.

Download ZIP

Haskell implementation of the Sieve of Eratosthenes algorithm for finding prime numbers.

Raw

Haskell Sieve of Eratosthenes

	sieve :: [Integer] -> [Integer]
	sieve [] = []
	sieve (x:xs)
	\| x < 2 = sieve xs
	\| otherwise = x : sieve (filter (\n -> n `mod` x /= 0) xs)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment