1 votes 1 votes $\Large T(n) = 2^nT(\frac{n}{2}) + n^n$ Algorithms asymptotic-notation time-complexity + – Mk Utkarsh asked Apr 19, 2019 Mk Utkarsh 925 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments srestha commented Apr 21, 2019 reply Follow Share no, we cannot apply master theorem because f(n) is not polynomial function here It is an exponential func. 0 votes 0 votes Anuranjan commented Jun 21, 2019 reply Follow Share We cant apply master theorem because a is not constant here 0 votes 0 votes omzzz commented Dec 16, 2020 reply Follow Share These may help https://www.geeksforgeeks.org/advanced-master-theorem-for-divide-and-conquer-recurrences/ 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes $T(n)=O(n^n logn)$ okntk answered Apr 15, 2023 okntk comment Share Follow See all 0 reply Please log in or register to add a comment.