1 votes 1 votes $T(n)=2T(\sqrt{n})+n$ Algorithms recurrence-relation + – Rameez Raza asked Jan 27, 2018 Rameez Raza 559 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments sumit goyal 1 commented Jan 27, 2018 reply Follow Share T(n) = 8T$\left ( \frac{n}{2} \right ) + n^{2}$ can you apply this logic here and tell what answer you got @Mk Utkarsh 0 votes 0 votes Mk Utkarsh commented Jan 27, 2018 reply Follow Share we don't need this logic here clearly $n^{log_{2}8} > n^{2}$ $\Theta (n^{3})$ 0 votes 0 votes Mk Utkarsh commented Jan 27, 2018 reply Follow Share that logic is used to convert a recurrence relation so that we can apply Master's theorem. Here we can directly apply 1 votes 1 votes Please log in or register to add a comment.
