Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Algorithms | Analysis of Algorithms (Recurrences) | Question 7

The running time of the following algorithm 
  Procedure A(n)  
  If n );
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
Article Tags :
DSA Quiz
Recommended Articles
1. Algorithms | Analysis of Algorithms (Recurrences) | Question 1
2. Algorithms | Analysis of Algorithms (Recurrences) | Question 2
3. Algorithms | Analysis of Algorithms (Recurrences) | Question 4
4. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
5. Algorithms | Analysis of Algorithms (Recurrences) | Question 6
6. Algorithms | Analysis of Algorithms (Recurrences) | Question 8
7. Algorithms | Analysis of Algorithms (Recurrences) | Question 9
8. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
9. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
10. Algorithms | Analysis of Algorithms (Recurrences) | Question 3
11. Algorithms | Analysis of Algorithms | Question 2
12. Algorithms | Analysis of Algorithms | Question 3
13. Algorithms | Analysis of Algorithms | Question 4
14. Algorithms | Analysis of Algorithms | Question 5
15. Algorithms | Analysis of Algorithms | Question 19
16. Algorithms | Analysis of Algorithms | Question 8
17. Algorithms | Analysis of Algorithms | Question 9
18. Algorithms | Analysis of Algorithms | Question 10
19. Algorithms | Analysis of Algorithms | Question 11
20. Algorithms | Analysis of Algorithms | Question 12
21. Algorithms | Analysis of Algorithms | Question 13
22. Algorithms | Analysis of Algorithms | Question 15
23. Algorithms | Analysis of Algorithms | Question 17
24. Algorithms | Analysis of Algorithms | Question 18
25. Algorithms | Analysis of Algorithms | Question 19