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
- A.
O(Ig n)
- B.
O(n)
- C.
O(n Ig n)
- D.
O(n2)
Attempted by 7 students.
Sign up free to check your answer
Sign up freeLoading lesson…

