Brainbench perl test?
davehodg at gmail.com
Tue Sep 4 17:18:20 BST 2012
On 4 Sep 2012, at 16:07, Smylers <Smylers at stripey.com> wrote:
> Piers Cawley writes:
>> Tower of Hanoi is always a better example for solving with recursion
>> than the fibobloodynacci sequence. If nothing else, the recursive
>> solution isn't quite so immediately obvious from the problem, the
>> terminating condition is obvious and an iterative solution isn't quite
>> so hogwhimperingly more efficient.
> Yes, that's much better.
When was the last time you recursed in day to day web type code?
More information about the london.pm