All Questions
5 questions
0
votes
1
answer
109
views
How does Lamé's Theorem give us an order-of-growth estimate for Euclid's Algorithm?
I'm reading SICP, and I don't understand how Lamé's Theorem gives us an estimate for the order-of-growth of Euclid's algorithm (the relevant passage is below). It would make sense to me if the ...
- 11
3
votes
3
answers
1k
views
Are lessons on tail recursion transferable to languages that don't optimize for it?
I'm currently reading through Structure and Interpretation of Computer Programs (SICP). During the course of that book, the lesson of "you can optimize recursive procedures by writing them as ...
- 1,007
11
votes
2
answers
4k
views
Approaching SICP in Clojure instead of Scheme
I am a third year bachelor student in a software engineering program, and I brought up the idea of reading SICP to an adviser to gain a deeper and more fundamental understanding of the principles ...
- 269
5
votes
1
answer
2k
views
What features does MIT-Scheme have that make it ideal for SICP?
I've been thinking about trying to get through the SICP again, this time well-armed with a better idea of what the SICP is meant to accomplish, and being older and wiser than my first attempt back in ...
- 278
9
votes
1
answer
922
views
SICP - Why use accumulate with cons when filter already passes back a list
In SICP 2nd Edition section 2.2.3,
the authors have the following code:
(define (even-fibs n)
(accumulate cons
nil
(filter even?
(map fib
...
- 193