计算机程序的构造和解释 练习题2.11

原来的过程里面是4次乘法的，根据题目的意思，根据端点进行判断把次数编程2次以内。

(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))))

端点我们可以按照三种情况，也就是区间都是正数、都是负数、一正一负。
然后x和y两个参数都有这三种情况，结合起来就是9种情况。
不过感觉这9种情况，看着太麻烦了，想得脑子抽筋。

#lang racket

(define (make-interval a b) (cons a b))
(define (lower-bound z)
  (min (car z) (cdr z)))
(define (upper-bound z)
  (max (car z) (cdr z)))

(define (interval-width z)
  (abs (- (car z) (cdr z))))

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

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


(define (mul-interval x y)
  (let ((lx (lower-bound x))
        (ux (upper-bound x))
        (ly (lower-bound y))
        (uy (upper-bound y)))
    (cond ((> lx 0)
           (cond ((> ly 0) (make-interval (* lx ly)  (* ux uy)))
                 ((< uy 0) (make-interval (* ux ly)  (* lx uy)))
                 (else (make-interval (* ux ly)  (* ux uy)))))
          ((< ux 0)
           (cond ((> ly 0) (make-interval (* lx uy)  (* ux ly)))
                 ((< uy 0) (make-interval (* ux uy)  (* lx ly)))
                 (else (make-interval (* lx uy)  (* lx ly)))))
          (else
           (cond ((> ly 0) (make-interval (* lx uy)  (* ux uy)))
                 ((< uy 0) (make-interval (* ux ly)  (* lx ly)))
                 (else (make-interval (min (* ux ly) (* lx uy))
                                      (max (* lx ly) (* ux uy)))))))))


(define (div-interval x y)
  (if (and (>= 0 (lower-bound y)) (<= 0 (upper-bound y)))
      (display "error")
  (mul-interval x (make-interval (/ 1.0 (lower-bound y)) (/ 1.0 (upper-bound y))))))


(mul-interval (make-interval 1 2) (make-interval 2 7))

运行结果

'(2 . 14)