Follow Us :

PA of Algorithms Q76

76Find a solution to the following recurrence equation
T(n) = T(n/2) + n
T(1) = 1
  • Option : A
  • Explanation :
    T (n) = T (n/2) + n
    Apply masters method
    nlog21 ⇒ n0
    1 < n
    T(n) = 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 *