925 views
1 votes
1 votes
$\Large T(n) = 2^nT(\frac{n}{2}) + n^n$

1 Answer

Related questions

1 votes
1 votes
2 answers
2
sh!va asked Oct 29, 2016
961 views
Find the upper bound of given function:f(n) =na) O(1)b) O( n)c) O(n 2)d) Both b and c
0 votes
0 votes
1 answer
3
sh!va asked Jul 12, 2016
567 views
Please explain how to solve this??What is the upper bound of computing time of m coloring decison problem for n nodes?a. O( n m)b. O( m n)c. O( n m n )d. O( m n m )e. O( ...