Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
Recursive function f(n), for completeness, from SICP exercise 1.11
(define (F n)
(cond ( (< n 3) n)
( else (+ (F (- n 1))
(* (F (- n 2)) 2)
(* (F (- n 3)) 3)))))
@enigmaticape

This comment has been minimized.

Copy link
Owner Author

enigmaticape commented Nov 16, 2012

From discussion of solution to exercise 1.11 of Structure and Interpretation of Computer Programs (SICP) on the Enigmatic Ape blog at http://www.enigmaticape.com/blog/sicp-exercise-1-10-ackermanns-antics/

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.