C + + code - - Factorial Recursion

Write code to complete PrintFactorial () 's recursive case. Sample output if userVal is 5:

5! = 5 * 4 * 3 * 2 * 1 = 120

#include

using namespace std;

void PrintFactorial (int factCounter, int factValue) {

int nextCounter = 0;

int nextValue = 0;

if (factCounter = = 0) { / / Base case: 0! = 1

cout << "1" << endl;

}

else if (factCounter = = 1) { / / Base case: Print 1 and result

cout << factCounter << " = " << factValue << endl;

}

else { / / Recursive case

cout << factCounter << " * ";

nextCounter = factCounter - 1;

nextValue = nextCounter * factValue;

}

}

int main () {

int userVal = 0;

userVal = 5;

cout << userVal << "! = ";

PrintFactorial (userVal, userVal);

return 0;

}

Question

Computers and Technology

Peyton Beltran

17 May, 14:30

C + + code - - Factorial Recursion

Write code to complete PrintFactorial () 's recursive case. Sample output if userVal is 5:

5! = 5 * 4 * 3 * 2 * 1 = 120

#include

using namespace std;

void PrintFactorial (int factCounter, int factValue) {

int nextCounter = 0;

int nextValue = 0;

if (factCounter = = 0) { / / Base case: 0! = 1

cout << "1" << endl;

}

else if (factCounter = = 1) { / / Base case: Print 1 and result

cout << factCounter << " = " << factValue << endl;

}

else { / / Recursive case

cout << factCounter << " * ";

nextCounter = factCounter - 1;

nextValue = nextCounter * factValue;

}

}

int main () {

int userVal = 0;

userVal = 5;

cout << userVal << "! = ";

PrintFactorial (userVal, userVal);

return 0;

}

+1

Answers (1)

Know the Answer?

Anthony Klein · Answer 1

Handle the print outside of the factorial function, which only needs one userVal when called.

int factorial (int foo)

{

if (foo = = 1)

return 1;

else

return (foo * factorial (foo - 1));

}