Hello SICP-ers,
with today's meeting (Ada Lovelace, 12:30) I'd like to close 1.2.x about "procedures and the process they generate". We've seen quite a bunch of algorithms and discussed about their big(O) measure of growth on several axis (notably computation and memory allocation) and it's time to move on. Personally I'm really looking forward 1.3 and start using higher order functions :)
The final part of 1.2.x is about GCD and their use in the computation of the Fermat little theorem which is very interesting from the optimisation point of view, including the exercises at the end. Please join me today to solve exercise 1.21 which assumes reading of "1.2.6 Example: Testing for Primality" and next Thu the assignment will be:
- 1.3 Formulating Abstractions with Higher-Order Procedures
- Quite a lot of read-along code here, so just one exercise
- Exercise 1.29
Cheers
Renzo