Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re^2: Recursion: the Towers of Hanoi problem

by insaniac (Friar)
on Oct 20, 2004 at 11:11 UTC ( #400818=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

well that's easy, the last 2 statements get executed when the algorithm is "rolling back" the loop. I mean: the last time the first movedisks statement is executed in the loop, it will start executing the last 2 statements from back to front (read: go over the loop from back to front)... that's what recursion is all about ;-)

to ask a question is a moment of shame
to remain ignorant is a lifelong shame
  • 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://400818]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (7)
As of 2016-10-27 07:53 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (355 votes). Check out past polls.