GATE | GATE CS 1996 | Question 37

The recurrence relation

 T(1) = 2
 T(n) = 3T(n/4)+n

has the solution, T(n) equals to
(A) O(n)
(B) O(log n)
(C) O(n^3/4)
(D) None of the above


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.