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); } }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

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);
}
}

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 6 images

Blurred answer
Knowledge Booster
Declaring and Defining the Function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education