Question: 3. (20 points) Write a recursive function that finds the factorial of an integer, n!-n (n-1) (n 2) 1. The recursive function, called factorial, should
3. (20 points) Write a recursive function that finds the factorial of an integer, n!-n (n-1) (n 2) 1. The recursive function, called factorial, should take as input a single integer and return the value of the factorial. Complete the following program skeleton to demonstrate your function. Write the preprocessor directive and declare the namespace you are using here Write the function factorial prototype here int main cout
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
