Java: How to sort a Stack using a temporary Stack?

Question

Can some one explain merge sort using linked list in java with code.

Answer 1

Try this method to sort stack where I have used "tempStack" as a temporary stack.

 public static Stack<Integer> sortStack(Stack<Integer> inputStack){
        Stack<Integer> tempStack = new Stack<Integer>();
        while(!inputStack.isEmpty()) {
            int temp = inputStack.pop();
            while(!tempStack.isEmpty() && tempStack.peek() > temp) {
                inputStack.push(tempStack.pop());
            }
            tempStack.push(temp);
        }
        return tempStack;
    }