If f is a numerical function and n is a positive integer, then we can form the nth repeated application of f, which is defined to be the function whose value at x is f(f(...(f(x))...)). For example, if f is the function x + 1, then the nth repeated application of f is the function x + n. If f is the operation of squaring a number, then the nth repeated application of f is the function that raises its argument to the 2^nth power. Write a procedure that takes as inputs a procedure that computes f and a positive integer n and returns the procedure that computes the nth repeated application of f. Your procedure should be able to be used as follows:
((repeated square 2) 5) 625You can use this to simplify the answer:
(define (compose f g) (lambda (x) (f (g x))))
最佳答案
(define (repeated f n)
(if (= n 1)
f
(compose f (repeated f (- n 1)))))
关于function - 重复应用Scheme中的函数？，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/249557/