The time complexity of recurrence relation T(n) = T(n/3) + T(2n/3) + O(n) is

UGC NET 2013

The time complexity of recurrence relation T(n) = T(n/3) + T(2n/3) + O(n) is

  1. A.

    O(Ig n)

  2. B.

    O(n)

  3. C.

    O(n Ig n)

  4. D.

    O(n2)

Attempted by 7 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…