1 votes 1 votes $T(n) = T(\lceil \frac{n}{2}\rceil ) + T(\lfloor \frac{n}{2}\rfloor) + 1$ $\Theta(n \log n)$ $\Theta(\log n)$ $\Theta(\log_2 n)$ $\Theta(n)$ Algorithms algorithms recurrence-relation + – Ashwani Kumar 2 asked Aug 8, 2016 • retagged Jun 23, 2022 by Lakshman Bhaiya Ashwani Kumar 2 577 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.