Algorithms | Analysis of Algorithms (Recurrences) | Question 11

Consider the following recurrence. T(n) = T() + What is the value of recurrence?
(A)
(B)
(B)
(B)
(A) A (B) B (C) C (D) D
Answer:(A)
Explanation: Change of variables: let m = lg n. Recurrence becomes S(m) = S(m/2) + theta(lgm). Case 2 of master’s theorem applies, so T(n) = theta( (log Log n) ^ 2).
Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-Analysis of Algorithms (Recurrences)

Analysis of Algorithms (Recurrences)

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 6

5. Algorithms | Analysis of Algorithms (Recurrences) | Question 7

6. Algorithms | Analysis of Algorithms (Recurrences) | Question 8

7. Algorithms | Analysis of Algorithms (Recurrences) | Question 9

8. Algorithms | Analysis of Algorithms (Recurrences) | Question 3

9. Algorithms | Analysis of Algorithms | Question 2

10. Algorithms | Analysis of Algorithms | Question 3

11. Algorithms | Analysis of Algorithms | Question 4

12. Algorithms | Analysis of Algorithms | Question 5

13. Algorithms | Analysis of Algorithms | Question 19

14. Algorithms | Analysis of Algorithms | Question 8

15. Algorithms | Analysis of Algorithms | Question 9

16. Algorithms | Analysis of Algorithms | Question 10

17. Algorithms | Analysis of Algorithms | Question 11

18. Algorithms | Analysis of Algorithms | Question 12

19. Algorithms | Analysis of Algorithms | Question 13

20. Algorithms | Analysis of Algorithms | Question 15

21. Algorithms | Analysis of Algorithms | Question 17

22. Algorithms | Analysis of Algorithms | Question 18

23. Algorithms | Analysis of Algorithms | Question 19

24. Algorithms Quiz | Analysis of Algorithms | Question 20

25. Algorithms | Analysis of Algorithms | Question 1