The sum procedure above generates a linear recursion. The procedure can be rewritten so that the sum is performed iteratively. Show how to do this by filling in the missing expressions in the following definition:
(define (sum term a next b) (define (iter a result) (if <??> <??> (iter <??> <??>))) (iter <??> <??>))
There are no comments yet.
You must log in to post a comment.Login
(define (inc n) (+ n 1)) (define (cube x) (* x x x)) (define (identity x) x) (check-equal? (sum cube 0 inc 2) 9) (check-equal? (sum cube 1 inc 10) 3025) (check-equal? (sum identity 1 inc 10) 55)