Created
May 18, 2017 14:25
-
-
Save abhilater/e3341d41576d7ddc44a37b8514193a49 to your computer and use it in GitHub Desktop.
Written a Clojure lazy-seq function to generate n prime numbers. It generates .5 million prime numbers in 20 secs
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
;; Clojure lazy-seq function to generate n prime numbers. | |
;; It generates .5 million prime numbers in 20 secs using | |
;; the naive non-sieve algo | |
;; Author: Abhishek Gupta (@abhilater) | |
(defn n-primes | |
[] | |
(filter (fn [num] | |
(loop [end (int (Math/sqrt num)), div 2, re (rem num div)] | |
(cond | |
(< num 2) false | |
(= num 2) true | |
(= re 0) false | |
(> div end) true | |
:else (recur end (inc div) (rem num div))) | |
)) (range))) | |
;;; (take 500000 (n-primes)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment