RecursiveNums

public class RecursiveNums {
    public static int[] reverseNum(int[] num)
    {
        if(num.length == 1)
            return num;

        else {
            int[] temp = new int[num.length];
            return reverseNum(num, temp, 0);
        }
    }

    public static int[] reverseNum(int[] num, int[] temp, int pos)
    {
        if(pos == num.length)
            return temp;

        else {
            temp[pos] = num[num.length - 1 - pos];
            return reverseNum(num,temp,pos+1);
        }
    }
}