Brainbench perl test?
uri at stemsystems.com
Tue Sep 4 17:43:40 BST 2012
On 09/04/2012 12:18 PM, David Hodgkinson 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?
every day. i see bad code and i curse. then i curse again, and again and
More information about the london.pm