2015/10/07

SICP 問題1.21

(define (smallest-divisor n)
  (find-divisor n 2))

(define (find-divisor n test-divisor)
  (cond ((> (square test-divisor) n) n)
        ((divides? test-divisor n) test-divisor)
        (else (find-divisor n (+ test-divisor 1)))))

(define (divides? a b)
  (= (remainder b a) 0))
gosh> (smallest-divisor 199)
199
gosh> (smallest-divisor 1999)
1999
gosh>(smallest-divisor 19999)
7

© 2022 wat-aro