0 votes 0 votes We saw that the solution of $T(n) = T(\lceil n/2 \rceil) + n$ is $O(lg\ n)$. Show that the solution of this recurrence is also $\Omega(n\ lg\ n)$. Conclude that the solution is $\Theta(n\log \ n)$. Algorithms cormen algorithms recurrence-relation descriptive + – akash.dinkar12 asked Apr 5, 2019 • edited Apr 5, 2019 by akash.dinkar12 akash.dinkar12 187 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.