SICP 习题2.8 区间减法_sicp 练习2.8-优快云博客

本文链接：https://blog.youkuaiyun.com/NMfloat/article/details/51629799

这篇博客探讨了SICP习题2.8中的区间减法概念。博主指出，区间减法即为从一个区间内的每个数中减去另一个区间的每个数，得到的结果区间由最小值（被减数区间的下界减去减数区间的上界）和最大值（被减数区间的上界减去减数区间的下界）确定，所有中间结果都包含在这个范围之内。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

我的想法是区间减法是a区间的每一个数减去b区间的每一个数，这些相减的结果在一个区间上。

也就是x的下界-y的上界是最小的，x的上界-y的下界是最大的。其他所有结果都在这两个数之间。

(define (add-interval x y)
  (make-interval (+ (lower-bound x) (lower-bound y))
         (+ (upper-bound x) (upper-bound y))))

(define (mul-interval x y)
  (let ((p1 (* (lower-bound x) (lower-bound y)))
    (p2 (* (lower-bound x) (upper-bound y)))
    (p3 (* (upper-bound x) (lower-bound y)))
    (p4 (* (upper-bound x) (upper-bound y))))
    (make-interval (min p1 p2 p3 p4)
           (max p1 p2 p3 p4))))

(define (div-interval x y)
  (mul-interval x 
        (make-interval (/ 1.0 (lower-bound y))
                   (/ 1.0 (upper-bound y)))))

(define (sub-interval x y)
  (make-interval (- (lower-bound x) (upper-bound y))
         (- (upper-bound x) (lower-bound y))))

(define make-interval cons)
(define lower-bound car)
(define upper-bound cdr)

(define print-interval
  (lambda (z)
    (newline)
    (display (lower-bound z))
    (display " ~ ")
    (display (upper-bound z))))

(define a (make-interval 1 2))
(define b (make-interval 3 4))

(print-interval (add-interval a b))
(print-interval (mul-interval a b))
(print-interval (div-interval a b))
(print-interval (sub-interval a b))