rodrigosetti
/ gist:947841
Created
April 29, 2011 04:35
Haskell interpreter session: Beautiful Sieve of Eratosthenes to generate primes
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Prelude> let sieve (p:ps) | p > 1 = p:(sieve $ filter ((> 0) . (`mod` p)) ps) | |
| Prelude> let primes = sieve [2..] | |
| Prelude> take 100 primes |
NewerOlder