Brainbench perl test?
pdcawley-london.0dd185 at bofh.org.uk
Tue Sep 4 17:27:31 BST 2012
On 4 September 2012 17:18, David Hodgkinson <davehodg at gmail.com> wrote:
> 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?
The last time I walked an object tree to turn it into a bare hash of
hashes for turning into JSON.
More information about the london.pm