40 lines
1.0 KiB
Scheme
40 lines
1.0 KiB
Scheme
;;; PRIMES -- Compute primes less than 100, written by Eric Mohr.
|
|
|
|
(library (rnrs-benchmarks primes)
|
|
(export main)
|
|
(import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
|
|
|
|
(define (interval-list m n)
|
|
(if (> m n)
|
|
'()
|
|
(cons m (interval-list (+ 1 m) n))))
|
|
|
|
(define (sieve l)
|
|
(letrec ((remove-multiples
|
|
(lambda (n l)
|
|
(if (null? l)
|
|
'()
|
|
(if (= (modulo (car l) n) 0)
|
|
(remove-multiples n (cdr l))
|
|
(cons (car l)
|
|
(remove-multiples n (cdr l))))))))
|
|
(if (null? l)
|
|
'()
|
|
(cons (car l)
|
|
(sieve (remove-multiples (car l) (cdr l)))))))
|
|
|
|
(define (primes<= n)
|
|
(sieve (interval-list 2 n)))
|
|
|
|
(define (main)
|
|
(run-benchmark
|
|
"primes"
|
|
primes-iters
|
|
(lambda (result)
|
|
(equal? result
|
|
'(2 3 5 7 11 13 17 19 23 29 31 37 41
|
|
43 47 53 59 61 67 71 73 79 83 89 97)))
|
|
(lambda (n) (lambda () (primes<= n)))
|
|
100)))
|
|
|