Find Asymptotic upper bound (http://www.csd.uwo.ca/~moreno/CS433-CS9624/Resources/master.pdf)

Question

$\Large T(n) = 2^nT(\frac{n}{2}) + n^n$

Comments

no, we cannot apply master theorem because f(n) is not polynomial function here

It is an exponential func.

---

We cant apply master theorem because a is not constant here

---

These may help

https://www.geeksforgeeks.org/advanced-master-theorem-for-divide-and-conquer-recurrences/

Answer 1

$T(n)=O(n^n logn)$