retagged by
472 views

1 Answer

1 votes
1 votes
A.

$n^{\lg c} = n^k $ has polynomial growth since $ k = \lg c $ is a constant.

$c^{\lg n}$ is exponential in $\lg n$ and hence $O(n).$

So, $$n^{\lg c} = \Theta\left(c^{\lg n}\right).$$

B.

$\lg (n^n) = n \lg n$

$\lg (n!) = \Theta ( n \lg n)$ (Stirling's approximation)

So, $$\lg (n!) = \Theta(\lg n^n).$$
edited by

Related questions

690
views
1 answers
0 votes
radha gogia asked Jun 24, 2018
690 views
n2 + O(n2) = Theta(n2) I am not getting how can we say that tightest bound is in terms of theta , because theta(n2 ) implicitly implies Big-Omega(n2 ) ... how can we say the tightest bound to be Big-Omega(n2 ) ? Please explain briefly .
2.9k
views
1 answers
3 votes
gate-17 asked Aug 7, 2016
2,919 views
consider the following functions f(n)=log*(log n) , g(n)=log(log* n) relations between these 2 function. please help
6.7k
views
3 answers
1 votes
worst_engineer asked Aug 20, 2015
6,674 views
f(n) = n2 logng(n) = n (logn)10Ans given as g(n) = O(f(n)) and f(n) != O(g(n))But , if I take base of log as 2then for random value of n ( say 16)g(n) = 16 * ... * ( 4 )10and f(n) = 256 * log216 = 256*4So , will it not be f(n) = O(g(n)) ?