Show that the factorial F(n) of a positive integer number n, i. e. , F(n) = I. 2

Question

Show that the factorial F(n) of a positive integer number n, i. e. , F(n) = I. 2. 3. 4. . (n-l). n may be expressed as a recursive function. Then design a program in C using the method of call by value and the recursive property of F(n) which, upon running, would generate the value of F(n) for a user-specified value of n. Make sure to include suitable "printf" statements so that, when the computation of F(n) is performed and outputted to the console, the output shows all the intermediate computational steps prior to displaying the computed value of F(n). Also you are to include a test to make sure that the integer number n you type is positive, i. e. , the program should not let you go forward until you type a positive integer number.

Explanation / Answer

#include<iostream>

#include<string.h>

using namespace std;

int factorial(int n) {

if(n==1) {

cout<<" Recursion complete. Calculating product in reverse ";

return 1;

}

  

cout<<"Recursion with n value:"<<n<<" ";

int fac = n*factorial(n-1);

cout<<"Intermediate product: "<<fac<<" ";

return fac;

}

int main() {

  

int in;

  

while(true) {

cout<<"Enter a positive number: ";

cin>>in;

  

if(in <= 0)

cout<<"Please enter valid number. ";

else

break;

}

cout<<" Intermediate steps : ";

int fac = factorial(in);

cout<<" Factorial of "<<in<<" is : "<<fac<<" ";

  

  

cout<<" ";

return 0;

}

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.