Follow Us :

PA of Algorithms Q77

77The recurrence relation
T(1) = 2
T(n) = 3T(n/4) + n
Has the solution T(n) equal to
  • Option : A
  • Explanation :
    T(n) = 3T (n/4) + n
    Apply master’s method
    nlog43 < n
    So O(n)
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *