Reverse a Stack using recursion

reverse.java

import java.util.Stack;
class Main {

    public static void main(String[] args) {
        Stack<Integer> stack = new Stack<Integer>();
        stack.push(30);
        stack.push(-5);
        stack.push(18);
        stack.push(14);
        stack.push(-3);
        stack.push(1);
        stack.push(-13);
        System.out.println(stack.toString());
        sortRecursive(stack);
        System.out.println(stack.toString());
    }
    
    public static void sortRecursive(Stack<Integer> stack){
        if(!stack.isEmpty()){
            int temp = stack.pop();
            sortRecursive(stack);
            insertMinBottom(stack,temp);
        }
    }
    
    public static void insertMinBottom(Stack<Integer> stack, int temp){
        if(stack.isEmpty())
        {
            stack.push(temp);
        }
        else
        {
                int temp2 = stack.pop();
                insertMinBottom(stack,temp);
                stack.push(temp2);
        }
    }
}