6.40 (Visualizing Recursion) It’s interesting to watch recursion “in action.” Modify the factorial function of Fig. 6.25 to print its local variable and recursive call parameter. For each recursive call, display the outputs on a separate line and add a level of indentation. Do your utmost to make the outputs clear, interesting and meaningful. Your goal here is to design and implement an output format that helps a person understand recursion better. You may want to add such display capabilities to the many other recursion examples and exercises throughout the text. // Fig. 6.25: fig06_25.cpp // Recursive function factorial. #include #include using namespace std; unsigned long factorial(unsigned long); // function prototype int main() { // calculate the factorials of 0 through 10 for (unsigned int counter{0}; counter <= 10; ++counter) { cout << setw(2) << counter << "! = " << factorial(counter) << endl; } } // recursive definition of function factorial unsigned long factorial(unsigned long number) { if (number <= 1) { // test for base case return 1; // base cases: 0! = 1 and 1! = 1 } else { // recursion step return number * factorial(number - 1); } }
C++
6.40 (Visualizing Recursion) It’s interesting to watch recursion
“in action.” Modify the factorial function of Fig. 6.25 to print its
local variable and recursive call parameter. For each recursive
call, display the outputs on a separate line and add a level of
indentation. Do your utmost to make the outputs clear,
interesting and meaningful. Your goal here is to design and
implement an output format that helps a person understand
recursion better. You may want to add such display capabilities
to the many other recursion examples and exercises
throughout the text.
// Fig. 6.25: fig06_25.cpp
// Recursive function factorial.
#include <iostream>
#include <iomanip>
using namespace std;
unsigned long factorial(unsigned long); // function prototype
int main() {
// calculate the factorials of 0 through 10
for (unsigned int counter{0}; counter <= 10; ++counter) {
cout << setw(2) << counter << "! = " << factorial(counter)
<< endl;
}
}
// recursive definition of function factorial
unsigned long factorial(unsigned long number) {
if (number <= 1) { // test for base case
return 1; // base cases: 0! = 1 and 1! = 1
}
else { // recursion step
return number * factorial(number - 1);
}
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 6 images
