What about a recursive function

#1

what will be the time complexity of a recursive function to compute the x^n

#2

public static void power(int num, int pow,int ans) { if(pow==0) { System.out.println(ans); return; } power(num,pow-1,ans*num); } is this function fine?

#3

For the algorithm power(x, n) complexity is O(n) because the depth of recursion correlates with n linearly.