Write a program that performs integer exponentiation of a base b to the power of n.
bⁿ = b × b × … × b where b is repeated n times
for example
2⁵ = 2 × 2 × 2 × 2 × 2 = 32
Input will contain two integers b and n where 0 < b, n ≤ 9
Output should contain a single integer indicating the value of bⁿ.
2 5
32
5 2
25
power
functionYour program should contain a power
function
that takes two integers and returns an integer.
The first integer argument should be the base and the second the exponent.
Please refer to the information for your chosen language:
int power(int b, int n);
power :: Int -> Int -> Int
def power(b, n):
int power(int b, int n);
public static int Power(int b, int e)
public static int power(int b, int e)
in a public class Power
function power(b, e)
function power (b, e)
def power(b, e)
You should perform the exponentiation as a series of multiplications. For this exercise, you should restrain from using your programming languages' built-in exponentiation functions.
The power
function should not print anything.
It should just perform the computation and return an integer.
The function and input/output processing
must exist in the same program.
Create a single submission with the function and main program.
If you’re confused, try earning a partial score first.
Specifically for this exercise when using Python, JavaScript, Lua or Ruby,
avoid using sys.exit()
, process.exit()
, os.exit()
or exit
,
as your program is appended with some extra assertions in one of the test sets.
power
functiontry first: factorial1
try next: fibonacci1
Copyright © 2020-2022 Rudy Matela
This text is available under the CC BY-SA 4.0 license.
Originally available on cscx.org/power1