In this program, we will create a recursive function to calculate the power of a given number using recursion and return the result to the calling function.
The source code to calculate the power of a given number using recursion is given below. The given program is compiled and executed successfully.
// Rust program to calculate the power
// of given number using recursion
fn CalculatePower(num:i32, power:i32)->i32 {
let mut result:i32 = 1;
if power > 0 {
result = num * (CalculatePower(num, power-1));
}
return result;
}
fn main() {
let mut res:i32=0;
res=CalculatePower(3,4);
println!("Result is: {}",res);
}
Output:
Result is: 81
Explanation:
In the above program, we created two functions CalculatePower() and main(). The CalculatePower() function is a recursive function, which is used to calculate the power of a given number and return the result to the calling function.
In the main() function, we called CalculatePower() function and printed the result.
Program/Source Code:
The source code to calculate the power of a given number using recursion is given below. The given program is compiled and executed successfully.
Output:
Explanation:
In the above program, we created two functions CalculatePower() and main(). The CalculatePower() function is a recursive function, which is used to calculate the power of a given number and return the result to the calling function.
In the main() function, we called CalculatePower() function and printed the result.
need an explanation for this answer? contact us directly to get an explanation for this answer