Algorithms | Analysis of Algorithms (Recurrences) | Question 7
The running time of the following algorithm
Procedure A(n)
If n <= 2 return(1) else return A();
is best described by
(A) O(n)
(B) O(log n)
(C) O(1og log n)
(D) O(1)
Answer: (C) Explanation: For explanation, please see question 5 of
this post
Quiz of this Question
Last Updated :
10 Jul, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...