import java.util.Stack; public class Sorting { public static void main(String[] args) { Stack<Integer> stack = new Stack<Integer>(); int[] numbers = { 4, 2, 0, 5, 6, 1, 3 }; for (int n : numbers) { stack.push(n); } stack = sort(stack); prettyPrint(stack); } /* 정렬된 스택을 반환 */ private static Stack<Integer> sort(Stack<Integer> origin) { Stack<Integer> temp = new Stack<Integer>(); /* 해당 알고리즘을 구현하시오. */ return temp; } private static void prettyPrint(Stack<Integer> stack) { System.out.println("| |"); while (!stack.isEmpty()) { System.out.printf("| %d |\n", stack.pop()); } System.out.println("-----"); } }