Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^2: Recursion: the Towers of Hanoi problem

by SpanishInquisition (Pilgrim)
on Oct 20, 2004 at 17:47 UTC ( #400924=note: print w/replies, xml ) Need Help??

in reply to Re: Recursion: the Towers of Hanoi problem
in thread Recursion: The Towers of Hanoi problem

Ironically that's the way I feel about work...

It's not about obfuscation, it's about coding 9 planes of existance higher than them because you can, and they don't want to learn...

  • Comment on Re^2: Recursion: the Towers of Hanoi problem

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://400924]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (13)
As of 2016-10-27 18:20 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (368 votes). Check out past polls.