Recursive : 

public class Solution {
    public static int[] reverseArray(int n, int[] nums) {
        return rev(0, n - 1, nums);
    }

    public static int[] rev(int start, int end, int[] nums) {
        if (start > end) {
            return nums;
        }
        int temp = nums[start];
        nums[start] = nums[end];
        nums[end] = temp;
        return rev(start + 1, end - 1, nums);
    }
}

Iterative :

public class Solution {
   public static int[] reverseArray(int n, int []nums) {
       int[] arr = new int[n];
       for(int i = 0; i< n; i++) {
           arr[n-i-1] = nums[i];
       }
       return arr;
   }
}

import java.util.List;
public class Solution {
    public static void printNtimes(int n){
        if(n <= 0) {
            return;
        }

        System.out.print("Coding Ninjas ");
        printNtimes(n - 1);
    }
}