Computing a positive integer power of a number is easily seen as a recursive process. Consider an: If n = 0, an is 1 (by definition) If n > 0, an is a times an–1 File Power.java downloadcontains a main program that reads in integers base and exp and calls method power to compute baseexp. Fill power. java in the code for power to make it a recursive method to do the power computation. The comments provide guidance. the power. java is below // * // Power.java Authors: Lewis, Loftus & DuVall-Early // Date: 4/17/21 // // Reads in two integers and uses a recursive power method // to compute the first raised to the second power. // * import java.util.Scanner; public class Power { // ---------------------------------------------- // main method // ---------------------------------------------- public static void main(String[] args) { int base, exp; int answer; Scanner scan = new Scanner(System.in); System.out.print("Welcome to the power program! "); System.out.println("Please use integers only."); //get base System.out.print("Enter the base you would like raised to a power: "); base = scan.nextInt(); //get exponent System.out.print("Enter the power you would like it raised to: "); exp = scan.nextInt(); answer = power (base,exp); System.out.println(base + " raised to the " + exp + " is " + answer); scan.close(); } // ---------------------------------------------- // Computes and returns base^exp // ---------------------------------------------- public static int power(int base, int exp) { int pow = 0; //if the exponent is 0, set pow to 1 //otherwise set pow to base*base^(exp-1) return pow; } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Computing a positive integer power of a number is easily seen as a recursive process. Consider aⁿ:
- If n = 0, an is 1 (by definition)
- If n > 0, an is a times a^n–1
File Power.java downloadcontains a main program that reads in integers base and exp and calls method power to compute base^exp. Fill power. java in the code for power to make it a recursive method to do the power computation. The
comments provide guidance.

the power. java is below

// *****************************************************************
// Power.java Authors: Lewis, Loftus & DuVall-Early
// Date: 4/17/21
//
// Reads in two integers and uses a recursive power method
// to compute the first raised to the second power.
// *****************************************************************
import java.util.Scanner;

public class Power
{
// ----------------------------------------------
// main method
// ----------------------------------------------
public static void main(String[] args)
{
int base, exp;
int answer;
Scanner scan = new Scanner(System.in);

System.out.print("Welcome to the power program! ");
System.out.println("Please use integers only.");

//get base
System.out.print("Enter the base you would like raised to a power: ");
base = scan.nextInt();

//get exponent
System.out.print("Enter the power you would like it raised to: ");
exp = scan.nextInt();

answer = power (base,exp);

System.out.println(base + " raised to the " + exp + " is " + answer);

scan.close();
}

// ----------------------------------------------
// Computes and returns base^exp
// ----------------------------------------------
public static int power(int base, int exp)
{
int pow = 0;

//if the exponent is 0, set pow to 1
//otherwise set pow to base*base^(exp-1)

return pow;
}
}

Expert Solution

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions