1 votes 1 votes The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) is O(Ig n) O(n) O(n Ig n) O(n$^2$) Algorithms ugcnetcse-sep2013-paper3 algorithms time-complexity recurrence-relation + – go_editor asked Jul 24, 2016 recategorized Oct 19, 2018 by Pooja Khatri go_editor 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes using recursive tree we .... n + n+ n+ n+ n+ n+ n = n.k n /(3/2)k=1 k = logn3/2 ==0(nlog3/2)== nlogn... Tauhin Gangwar answered Jul 25, 2016 selected Jan 21, 2017 by Sanjay Sharma Tauhin Gangwar comment Share Follow See all 0 reply Please log in or register to add a comment.