The recurrence \(T(n) = 2T(n/2) + n \log n\), solved using the Master Theorem,…

TPSC Computer/IT Posts 2026

The recurrence T(n)=2T(n/2)+nlog⁡nT(n) = 2T(n/2) + n \log n, solved using the Master Theorem, gives

  1. A.

    O(nlog⁡n)O(n \log n)

  2. B.

    O(nlog⁡2n)O(n \log^2 n)

  3. C.

    O(n2log⁡n)O(n^2 \log n)

  4. D.

    Cannot be solved by Master Theorem directly

Attempted by 61 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…