Use a tree stack to sort number in java?

The Question is : Three stacks can be used to sort a list of numbers. Assuming stack in holds the input list of numbers, stack out is to hold the output list after sorting the numbers and temp is used during the sorting process. The sorting algorithm follows.

1 set up stack in and print it 2 while stack in is not empty repeat 2.1 max = in.pop 2.2 while there are still element in stack in repeat 2.2.1 value = in.pop 2.2.2 if value > max 2.2.2.1 temp.push(max) 2.2.2.2 max = value 2.2.3 else 2.2.3.1 temp.push(value) 2.3 in = temp 2.4 out.push(max) 2.5 temp.clear

3 print sorted stack

this my coding

import java.util.*;

  System.out.println("MAx: " +Max);
  System.out.println("Value: " +Value);

 if (Value > Max)
 {
  Temp.push(Max);
  Max=Value;

  } else {
  Temp.push(Value);

 }

 Input = Temp;
 OutPut.push(Max);
 Temp.clear();

} System.out.println("The Output Stack is: " + OutPut);

} }