More than 5 years have passed since last update.

エラトステネスの篩

Scheme

Last updated at 2012-12-26Posted at 2012-08-28

書いてた人がいたので…

prime.scm

(use srfi-1)
(define (prime n)
  (let loop ((lst (iota (- n 1) 2))(result '()))
	(let ((solve (cons (car lst) result)))
	  (if (< (last lst) (* (car solve) (car solve)))
		(append (reverse result) lst)
		(loop (remove (^(x)(zero? (remainder x (car lst)))) lst) solve)))))

;(time (prime 10000))
; real   0.011
; user   0.010
; sys    0.000

You get articles that match your needs
You can efficiently read back useful information
You can use dark theme

What you can do with signing up