Consider the algorithm below: ALGORITHM F(n) //Computes n! recursively //Input: A nonnegative integer n //Output: The...

 

Transcribed Image Text:

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 (n-1) * n 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(n-1) + 2 * 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 F(n) //Computes n! recursively //Input: A nonnegative integer n //Output: The value of n! if n = 0 return 1 else return F (n-1) * n 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(n-1) + 2 * 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?