Re^2: recursion basics

[wrinkles]

Even slow that's a challenge. Why does the final return only run once? I mean, why doesn't the return interrupt the unwinding earlier?

[aaron_baugher]

Check my first reply for a more detailed explanation, but the short version is that, each time the function calls itself, the caller stops and waits for the "child" function to finish. So none of the instances reach that final return until one of them returns from the first return, then they all finish and hit the second return in reverse order. Something like this:

binary1 calls binary2, stops and waits for it
  binary2 calls binary3, stops and waits for it
    binary3 calls binary4, stops and waits for it
      binary4 returns from the first return line ($n==1)
    binary3 finishes, returns
  binary2 finishes, returns
binary1 finishes, returns
print statement executes, printing binary1's return value

[robby_dobby]

Read my post here. Hopefully, it should make it clear to you.

[Anonymous Monk]

Even slow that's a challenge. Why does the final return only run once? I mean, why doesn't the return interrupt the unwinding earlier?

Um, try this, and ask yourself what happens

Rip();
sub Rip {
  print "Rip on\n";
  Van(); Winkle(); 
  print "Rip off\n";
}
sub Van {
  print "Van on\n";
  Winkle(); 
  print "Van off\n";
}
sub Winkle {
  print "Winkle\n";
}
__END__
Rip on
Van on
Winkle
Van off
Winkle
Rip off