Interestingly my solution of balance-example is tail-recursive even though it wasn't my intention.
I tried to make pascal-example tail-recursive: but the solution looks very complicated.
Martin Odersky explains how to make factorial tail-recursive in the first lecture of week 2 of »Functional Programming Principles in Scala«.
In the evening I could show an example of tail-recursive fibonacci.
On 24.09.2012, at 20:32, Felix Amerbauer wrote:
+1Just completed my exercises of week 1. I got full scores but none of my solutions is tail recursive so if anybody has a tail recursive solution I'd be interested
The exercises of week 2 should be available too before our meeting takes place.