(define (find-closest-number goal p) (if (null? (cdr p)) (car p) (if (< (abs (- goal (car p))) (abs (- goal (find-closest-number goal (cdr p))))) (car p) (find-closest-number goal (cdr p)))))
(define (pick-closest goal a b) (if (< (abs (- goal a)) (abs (- goal b))) a b)) (define (find-closest-number goal p) (if (null? (cdr p)) (car p) (pick-closest goal (car p) (find-closest-number goal (cdr p)))))
(define (pick-minimizer f a b) (if (< (f a) (f b)) a b)) (define (find-minimizer f p) (if (null? (cdr p)) (car p) (pick-minimizer f (car p) (find-minimizer f (cdr p)))))Use find-minimizer to define a procedure that finds the largest number in a list of positive integers:
Song ::= Verse VBBD VBBD Better Coda
VBBD ::= Verse Bridge Bridge Dadada (ends on C)
Coda ::= F Eb Bb F Coda
Note: the Coda has no base case, and should continue forever (time permitting).
Define a Scheme procedure that can produce the INT and Gplot graphs from GEB Chapter 5. Hint: you may need to think about curves differently from PS3. (A solution is worth two gold stars.)
Find a "pop" song that has a recursive stack at least three deep.