4 votes 4 votes What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$ Algorithms algorithms time-complexity recurrence-relation recursion + – Aakanchha asked Jan 8, 2018 edited Jan 11, 2018 by Anu007 Aakanchha 801 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Aakanchha commented Jan 11, 2018 reply Follow Share how to solve this using masters theorem? 0 votes 0 votes Mk Utkarsh commented Jan 11, 2018 reply Follow Share a = 4, b = 2, k = 2, p = 0 a = bk hence if (p>-1) then T(n) = $\Theta (n^{log_{b}a}log^{p+1}n)$ 0 votes 0 votes Mk Utkarsh commented Jan 11, 2018 reply Follow Share https://www.youtube.com/watch?v=lPUhHmgrpik refer this 0 votes 0 votes Please log in or register to add a comment.