fork download
  1. import java.util.Scanner;
  2.  
  3. class recursion {
  4. public static void main(String args[]) {
  5. Scanner scanner = new Scanner(System.in);
  6. int base = 0;
  7. int expo = 0;
  8.  
  9. System.out.print("Enter number for base ");
  10. base = scanner.nextInt();
  11.  
  12. System.out.print("Enter number for exponent ");
  13. expo = scanner.nextInt();
  14.  
  15. do
  16. System.out.println(base + "^" + expo + " = " + pow(base, expo));
  17. while (expo-- > 1);
  18. }
  19.  
  20.  
  21. public static int pow(int x, int p) {
  22. if (p == 0)
  23. return 1;
  24. if (p % 2 == 0) {
  25. int a = pow(x, (p / 2));
  26. return a * a;
  27. } else {
  28. int a = pow(x, ((p - 1) / 2));
  29. return x * a * a;
  30. }
  31.  
  32. }
  33. }
Success #stdin #stdout 0.1s 380608KB
stdin
5
2
stdout
Enter number for base Enter number for exponent 5^2 = 25
5^1 = 5