
198 Design and Analysis of Algorithms
1. Execution trace (ET) a sequence showing
the exact order in which various statements in
an algorithm are executed. Each statement is
usually represented by a symbol.
2. Explicit stack Usually the return address
and local values stack, required to be used
when implementing a High Level Language,
is hidden from the programmer, though it
is present implicitly. For implementation of
some algorithms, we are forced to use a stack
of our own, in our program. That is explicit
stack. The programmer would be responsible
to manipulate the stack.
3. Inherently recursive a function which can
not be expressed ...