0 votes 0 votes Use the master method to give tight asymptotic bounds for the following recurrences. $T(n)=2T(n/4) + 1$ $T(n)=2T(n/4) +\sqrt{n}$ $T(n)=2T(n/4) +n$ $T(n)=2T(n/4) +n^2$ Algorithms cormen algorithms recurrence-relation master-theorem + – akash.dinkar12 asked Apr 5, 2019 edited Apr 5, 2019 by akash.dinkar12 akash.dinkar12 660 views answer comment Share Follow See 1 comment See all 1 1 comment reply Hira Thakur commented Oct 10, 2019 reply Follow Share 1. $\Theta$(√ n) 2.$\Theta (√ n)logn$ 3.$\Theta (n)$ 4.$\Theta (n^2)$ please verify it. 1 votes 1 votes Please log in or register to add a comment.