Question: Consider the algorithm below: ALGORITHM F(n) //Computes n ! recursively //Input: A nonnegative integer n// Output: The value of n ! if n=0 return 1

Consider the algorithm below: ALGORITHM F(n) //Computes n ! recursively //Input: A nonnegative integer n// Output: The value of n ! if n=0 return 1 else return F(n1)n a. What is the algorithm's basic operation? b. What is the resulting recursive equation? c. Solve the equation you gave in (b). d. What is the worst case time complexity of this algorithm? Consider the algorithm below: ALGORITHM Q(n) //Input: A positive integer n if n=1 return 1 else return Q(n1)+2n a. What is the algorithm's basic operation? b. What is the resulting recursive equation? c. Solve the equation you gave in (b). d. What is the worst case time complexity of this algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
