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
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
… [Trackback]
[…] Find More to that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-recurrences-question-7/ […]
… [Trackback]
[…] Information on that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-recurrences-question-7/ […]