5
votes
Accepted
Are lessons on tail recursion transferable to languages that don't optimize for it?
In fact, I'm nearly 100 pages in and have yet to see a single for or while loop - it's all been recursion.
Spoiler alert: you won't be seeing any loops in the book, for the simple reason that the ...
- 105k
2
votes
Are lessons on tail recursion transferable to languages that don't optimize for it?
The SCIP book is about the fundamentals of programming and programming languages. It is not about lessons which you will apply to one specific programming language, rather it is about understanding ...
- 62.4k
1
vote
How does Lamé's Theorem give us an order-of-growth estimate for Euclid's Algorithm?
In my edition of SICP (first edition from 1987), the final sentence in that paragraph contained indeed O(log n), not Theta(log n), which fits to your observation - the provided proof literally just ...
- 220k
1
vote
Are lessons on tail recursion transferable to languages that don't optimize for it?
For example, the sum of integers from n to m is 0 if n > m, and n plus the sum of integers from n+1 to m otherwise. You can write code for this using tail recursion. If tail recursion is part of ...
- 49.4k
Only top scored, non community-wiki answers of a minimum length are eligible