📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!
  • google app store apple app store
    • ✖

      Question

      The Master Theorem gives time complexity for recurrences

      of the form:
      A T(n) = T(n–1) + O(1) Correct Answer Incorrect Answer
      B T(n) = aT(n/b) + f(n) Correct Answer Incorrect Answer
      C T(n) = aT(n) + bT(n/b) Correct Answer Incorrect Answer
      D T(n) = nT(n) + O(1) Correct Answer Incorrect Answer
      E T(n) = T(log n) + O(n) Correct Answer Incorrect Answer

      Solution

      Master theorem provides asymptotic bounds for divide-and-conquer recurrences T(n)=aT(n/b)+f(n).

      Practice Next
      More Algorithms Questions
      ask-question