Re: Translation from recursive to iterative

From: BQ (balulaz_at_libero_dot_it_at_libero.invalid)
Date: 03/23/05 

Date: Wed, 23 Mar 2005 00:09:53 +0100

Eric Sosman wrote:

>
> If you're sure this is the algorithm you want to use,
> go ahead and implement it with an explicit stack of your own:
> a local array of start/end pairs plus an index indicating
> where the stack top is.

[CUT]

Eric, your post was very useful and teached my this new (new for me) use
of a stack. Thank you very much!!
Regards,
  Marco

Relevant Pages

  • Re: Why is throw called throw?
    ... Eric Sosman wrote: ... > Not on the floor, but to a point higher in the ... > call stack. ... An exception is what happens when your ...
    (comp.lang.java.help)
  • Re: Memory allocation by malloc
    ... Eric Sosman wrote: ... >> which old IBM programmers used to distinguish ... A heap is very like a stack, ... Richard ...
    (comp.lang.c)
  • Re: more math parser questions
    ... Eric Sosman wrote: ... > values off the stack, add them, and push the sum (the stack ... > off the stack, multiply them, and push the product (the stack ...
    (comp.lang.java.help)
  • Re: hacker challenge - traverse a list
    ... that stack to a long integer and packing its values, ... Your algorithm, in abstract, is either bounded (and thus does not solve ... "Platonism" has a precise meaning. ... The problem here is that thugs think they can discount intentions. ...
    (comp.programming)
  • Re: hard disk faster than main memory?
    ... > sophisticated numerical algorithm working on stacks. ... For sometimes our stack size ... > writing everything to hard disk is faster than the stack implementation ... A random I/O operation to disk is usually ...
    (comp.programming)