GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaProgramming/Recursion/Power.java at main · karterhhgg/JavaProgramming Expand file tree/ Copy pathPower.javaMore file actions 35 lines (32 loc) · 963 Bytes / Copy pathPower.javaFile metadata and controls35 lines (32 loc) · 963 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 // Print x^n (with stack height = n) package Recursion; import java.util.*; public class Power { public static int calcPower(int x, int n) { if(n == 0){ // base case1 return 1; } if(x == 0){ // base case2 return 0; } int xPownm1 = calcPower(x, n-1); // calculate the x power n-1(x^n-1) int xPown = x * xPownm1; // calculate the x power n (x^n) return xPown; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter the value of x: "); int x = sc.nextInt(); System.out.print("Enter the value of n: "); int n = sc.nextInt(); int ans = calcPower(x,n); System.out.print("Calculated power is: "); System.out.println(ans); } } // output /* Enter the value of x: 2 Enter the value of n: 1 Calculated power is: 2 */ |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |