Register

Cormen 3rd edition Problem 3-2 part (f)

253 views
0 votes
0 votes

Indicate for pair of expressions (A,B) whether A is O, o, Ω, ω or  of B?

A = lg(n!)

B = lg(n^n)

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Neha_16 asked Apr 27, 2018
5,890 views
Cormen 3rd edition Exercise 4.4.9
Use a recursion tree to give an asymptotically tight solution to the recurrence T(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant.
Use a recursion tree to give an asymptotically tight solution to the recurrenceT(n) =T(an)+T((1-a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant...
User Avatar
1 votes
1 votes
2 answers
2
Injila asked May 5, 2017
2,555 views
Cormen 3rd edition
Which is asymptotically larger: lg(lg* n) or lg* (lg n)?
Which is asymptotically larger: lg(lg* n) or lg* (lg n)?
User Avatar
0 votes
0 votes
1 answer
3
amitatgateoverflow asked Jul 18, 2016
399 views
book[cormen - solution 2nd edition] solution to problem 3-3
Prove that : log*(log n) = log*n -1.
Prove that : log*(log n) = log*n -1.
User Avatar
0 votes
0 votes
0 answers
4
dragonball asked Jun 22, 2017
638 views
CLR 3rd edition , Page no. 49 , second para
"The running time of insertion sort is not Ω($n^{2}$) , since there exists an input for which insertion sort runs in $\Theta (n)$. It is not contradictory , however , to say that the worst case running time of insertion sort is Ω($n^{2}$) " . Could anyone explain this line ?
"The running time of insertion sort is not Ω($n^{2}$) , since there exists an input for which insertion sort runs in $\Theta (n)$. It is not contradictory , however , t...
User Avatar
Link Copied!