Last active
August 29, 2015 13:57
-
-
Save srideepprasad/9525195 to your computer and use it in GitHub Desktop.
Simple Clojure Prime Sieve
This file contains 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
(defn primes [m n] | |
(defn filter-non-primes | |
([numbers] (filter-non-primes numbers #{})) | |
([numbers current-prime-set] | |
(let | |
[next-prime (first numbers)] | |
(if (empty? numbers) | |
(filter #(> %1 m) current-prime-set) | |
(recur (doall(remove #(= (mod %1 next-prime) 0) numbers)) (conj current-prime-set next-prime)) | |
)))) | |
(filter-non-primes (range 2 n)) | |
) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment