The source code to demonstrate recursion is given below. The given program is compiled and executed successfully.
// Rust program to demonstrate
// the recursion
fn RecursiveFun(val:i32)->i32 {
let mut num:i32=val;
if num == 0 {
return num;
} else {
print!("{} ", num);
}
num = num - 1;
return RecursiveFun(num);
}
fn main() {
RecursiveFun(10);
println!();
}
Output:
10 9 8 7 6 5 4 3 2 1
Explanation:
In the above program, we created two functions RecursiveFun() and main(). The RecursiveFun() function is a recursive function, which is used to print numbers from a given number to 1.
In the main() function, we called RecursiveFun() function and printed the result.
Program/Source Code:
The source code to demonstrate recursion is given below. The given program is compiled and executed successfully.
Output:
Explanation:
In the above program, we created two functions RecursiveFun() and main(). The RecursiveFun() function is a recursive function, which is used to print numbers from a given number to 1.
In the main() function, we called RecursiveFun() function and printed the result.
need an explanation for this answer? contact us directly to get an explanation for this answer