Re^2: Arbitrarily Nested HoH

Perhaps I am misunderstanding your comment, but if your recursion uses a stack (which, I would say, at least the calls do), the solution has to be LIFO. A queue would be FIFO.

This could just be a difference between understanding your comment differently than the way you meant to say it.

--MidLifeXis

Comment on Re^2: Arbitrarily Nested HoH

Replies are listed 'Best First'.
Re^3: Arbitrarily Nested HoH by sundialsvc4 (Abbot) on Oct 15, 2010 at 17:08 UTC
Stack. Queue. Whatever. `:-D` “Verily, verily, I code unto thee: he who seeks to be first, shall be last...” `:-;` You store the items, in some method and according to some suitable discipline, and then you “work through the list(s).” That’s the gist of it.


Perl-Sensitive Sunglasses
	PerlMonks