Question

(JAVA-CS113)Does anyone have any recursive practice questions that have solutions, need to study simple ones for exam like raising a number to a power is a simple one, so ones like this, or any other final exam practice for CS113 java.

Answer 1

import java.util.*;

public class PowerOfNumber{
   public static int power(int num, int pow) {
  
if (pow==0) // base condition
return 1;
else
return (num * power(num, pow-1)); // recursive call
}
public static void main(String[] args) {
int num,power;
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number : ");
num=sc.nextInt();
System.out.println("Enter a power : ");
power=sc.nextInt();
int result = power(num,power); // function call
System.out.println(num+" to the power "+power+" is "+result);
}
}

OUTPUT:-

// If any doubt please comment