Summary of last Thursday club

[Renzo Borgatti]

Sorry, I'm terribly late with this summary. So the assignment was about 1.2.2 and exercises 1.11, 1.12 and 1.13.

Here the self assessment guide (you should be able to talk briefly through each bullet):

- Tree recursive process
- Fib follows the Golden ratio growth rate
- Tree recursive process computation and memory requirements, which is linear and which is exponential?
- Is the coin change algorithm solution given as an example (pag 53) efficient?
- What is the general process to transform a recursive process into an iterative process?

Here's a summary of what we discussed during the club:

- can a recursive process always be implemented as iterative?
- Some good answers here http://stackoverflow.com/questions/1549943/design-patterns-for-converting-recursive-algorithms-to-iterative-ones
- tail recursion optimisation is the process by which a compiler (not us) can figure out the iterative process for an algorithm that is expressed as non-tail recursive
- Scheme is one of those languages that by design specifications can automatically tail-recur when applicable

Cheers
Renzo