Question: f(1) Questiont: Given the following algorithm (4 marks) f(n-1)*n ALGORITHM F(n) I/Input: A nonnegative integer n I/Output: The value of n! if n = 0

f(1) Questiont: Given the following algorithm (4 marks) f(n-1)*n ALGORITHM F(n) I/Input: A nonnegative integer n I/Output: The value of n! if n = 0 return 1 else return F(n-1)*n . What does this algorithm compute? complaxty 6. What is its basic operation? [-,*11] c. How many times is the basic operation executed? Maximum 5 minte d. What is the efficiency class of this algorithm? Class of functions faster then ifuata X
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
