0 votes 0 votes Argue that the solution to the recurrence $T(n)=T(n/3)+T(2n/3)+cn$,where $c$ is a constant, is $\Omega(n\lg n)$ by appealing to a recursion tree. Algorithms cormen algorithms recurrence-relation descriptive + – akash.dinkar12 asked Apr 5, 2019 akash.dinkar12 165 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.