Answered step by step
Verified Expert Solution
Question
1 Approved Answer
In C++ Write a function fact(n) that calculates factorial of n recursively. Example: fact(5) = 5*4*3*2*1 = 120. Note that fact(0) is defined to be
In C++
Write a function fact(n) that calculates factorial of n recursively. Example: fact(5) = 5*4*3*2*1 = 120. Note that fact(0) is defined to be 1, so that will be your base case. You may assume that the function is always called with a nonegative integer.
Prototype: int fact(int n);
You'll only need three to four lines of code in the function body.
The driver used to test your code is below:
int main(){ int n; cin >> n; cout << n << "! = " << fact(n) << endl; return 0; }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started