stack sorting(without recursion) using three stacks only!! can anyone tell me something about it!!?

Question

all stacks have to be used in sorting process and elements of first stack should be in any one of the other two stacks after the sorting is complete. a bit hint of it is that it has to be solved with the same technique as of solving a towers of hanoi problem!!

Answer 1

Try this link.
There is code too. All you have to do is read, understand and write your program.