In this program, we will create a recursive function to calculate the sum of all digits of a given number using recursion and return the result to the calling function.
The source code to calculate the sum of the digits of a given number using recursion is given below. The given program is compiled and executed successfully.
// Rust program to calculate the
// sum of the digits of given number
// using recursion
unsafe fn SumOfDigits(num:i32)->i32 {
static mut sum:i32=0;
if num > 0 {
sum += (num % 10);
SumOfDigits(num / 10);
}
return sum;
}
fn main()
{
unsafe{
let res=SumOfDigits(1234);
println!("Sum of digits are: {}",res);
}
}
Output:
Sum of digits are: 10
Explanation:
In the above program, we created two functions SumOfDigits() and main(). The SumOfDigits() function is a recursive function, which is used to calculate the sum of the digits of the given number and return the result to the calling function.
In the main() function, we called SumOfDigits() function and printed the result.
Program/Source Code:
The source code to calculate the sum of the digits 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 SumOfDigits() and main(). The SumOfDigits() function is a recursive function, which is used to calculate the sum of the digits of the given number and return the result to the calling function.
In the main() function, we called SumOfDigits() function and printed the result.
need an explanation for this answer? contact us directly to get an explanation for this answer