; closest two-sum to zero
(define (range . args)
(case (length args)
((1) (range 0 (car args) (if (negative? (car args)) -1 1)))
((2) (range (car args) (cadr args) (if (< (car args) (cadr args)) 1 -1)))
((3) (let ((le? (if (negative? (caddr args)) >= <=)))
(let loop ((x(car args)) (xs '()))
(if (le? (cadr args) x)
(reverse xs)
(loop (+ x (caddr args)) (cons x xs))))))
(else (error 'range "unrecognized arguments"))))
(define randint #f)
(let ((two31 #x80000000) (a (make-vector 56 -1)) (fptr #f))
(define (mod-diff x y) (modulo (- x y) two31)) ; generic version
; (define (mod-diff x y) (logand (- x y) #x7FFFFFFF)) ; fast version
(define (flip-cycle)
(do ((ii 1 (+ ii 1)) (jj 32 (+ jj 1))) ((< 55 jj))
(vector-set! a ii (mod-diff (vector-ref a ii) (vector-ref a jj))))
(do ((ii 25 (+ ii 1)) (jj 1 (+ jj 1))) ((< 55 ii))
(vector-set! a ii (mod-diff (vector-ref a ii) (vector-ref a jj))))
(set! fptr 54) (vector-ref a 55))
(let* ((seed (mod-diff seed 0)) (prev seed) (next 1))
(vector-set! a 55 prev)
(do ((i 21 (modulo (+ i 21) 55))) ((zero? i))
(vector-set! a i next) (set! next (mod-diff prev next))
(set! seed (+ (quotient seed 2) (if (odd? seed) #x40000000 0)))
(set! next (mod-diff next seed)) (set! prev (vector-ref a i)))
(flip-cycle) (flip-cycle) (flip-cycle) (flip-cycle) (flip-cycle)))
(if (negative? (vector-ref a fptr)) (flip-cycle)
(let ((next (vector-ref a fptr))) (set! fptr (- fptr 1)) next)))
(let ((t (- two31 (modulo two31 m))))
(let loop
((r
(next
-rand))) (if (<= t r
) (loop
(next
-rand)) (modulo r m
))))) (init
-rand 19380110) ; happy birthday donald e knuth
(cond
((null? seed
) (/ (next
-rand) two31
)) ((eq? (car seed) 'get) (cons fptr (vector->list a)))
((eq? (car seed) 'set) (set! fptr (caadr seed))
(set! a (list->vector (cdadr seed))))
(else (/ (init
-rand (modulo
(numerator
(inexact->exact (car seed))) two31)) two31)))))
(set! randint (lambda args
(cond ((null? (cdr args))
(if (< (car args
) two31
) (unif
-rand (car args
)) ((< (car args) (cadr args))
(let ((span (- (cadr args) (car args))))
(+ (car args)
(if (< span two31
) (unif
-rand span
) (else (let ((span (- (car args) (cadr args))))
(- (car args)
(if (< span two31
) (unif
-rand span
)
(define (rand-list k n)
(map (lambda (r) (randint (- 1 n) n)) (range k)))
(define (brute-force xs)
(let ((min-sum (apply max xs)) (min-pair (list)))
(do ((ys xs (cdr ys))) ((null? ys) min-pair)
(do ((zs (cdr ys) (cdr zs))) ((null? zs))
(let
((s
(abs (+ (car ys
) (car zs
))))) (when (< s min-sum)
(set! min-sum s)
(set! min-pair (list (car ys) (car zs)))))))))
(define (sort-and-scan xs)
(define
(lt
? x y
) (< (abs x
) (abs y
))) (let loop ((xs (sort xs lt?))
(min-sum (apply max xs))
(min-pair (list)))
(if (null? (cdr xs)) min-pair
(let
((s
(abs (+ (car xs
) (cadr xs
))))) (if (< s min-sum)
(loop (cdr xs) s (list (car xs) (cadr xs)))
(loop (cdr xs) min-sum min-pair))))))
(let ((xs (rand-list 7 100)))
(display xs) (newline)
(display (brute-force xs)) (newline)
(display (sort-and-scan xs)) (newline))