Need help! Algorithm java implementation

Question

Hi,
I am trying to make a simple java program based on an algorithm which will print out all the odd numbers in a stack. But first it should put all the numbers into an auxiliary stack from the original stack but in reverse order. Then the algorithm should put the odd numbers into the new stack (copystack)
Algorithm
To obtain a stack containing only the elements in Stack thisStack which are at odd depth
where thisStack has depth depth
1. Let copyStack and sAux be empty ArrayStacks
2. Let size be equal to depth
3. Repeat size times
3.1 Let elem be the Object returned by popping thisStack
3.2 Push elem into sAux.
4. Let oddPosition = 1 ? size modulo 2.
5. Repeat from numReps = 0 to numReps = size - 1
5.1 Let elem be the result of popping sAux
5.2 Push elem into thisStack
5.2 if numReps mod 2 equals oddPosition
5.3.1 Push elem into copyStack
6. Terminate with answer copyStack
Use the ?push? (i.e. void addLast(Object)) and ?pop? (i.e. Object removeLast()) methods already available
from class ArrayStack to implement the new method as follows: Take all the elements, one at a time, from the
original stack into an auxiliary stack. The auxiliary stack now contains the same elements as the original stack,
but in reverse order. Take the elements from the auxiliary stack onto both the original stack and the new (copy)
stack if appropriate

Answer 1

Indeed. It's much less likely he'd double-post too.
http://forum.java.sun.com/thread.jspa?threadID=5278338&tstart=0