What is the time complexity of the above recursive implementation to f – McqOptions

MCQOPTIONS

1.	What is the time complexity of the above recursive implementation to find the factorial of a number?
A.	O(1)
B.	O(n)
C.	O(n<sup>2</sup>)
D.	O(n<sup>3</sup>)
Answer» D. O(n<sup>3</sup>)

Discussion

No Comment Found

Related MCQs

How many times will the function fact() be called when the following code is executed?
Consider the following recursive implementation to find the factorial of a number. Which of the lines is the base case?
What is the space complexity of the following recursive implementation to find the factorial of a number?
The time complexity of the following recursive implementation to find the factorial of a number is ________
Consider the following recursive implementation to find the factorial of a number. Which of the lines should be inserted to complete the below code?
Consider the following iterative implementation to find the factorial of a number. Which of the lines should be inserted to complete the below code?
In general, which of the following methods isn’t used to find the factorial of a number?
What is the time complexity of the above recursive implementation to find the factorial of a number?
Which of the following recursive formula can be used to find the factorial of a number?
Which of the following methods can be used to find the factorial of a number?