edited by
343 views

1 Answer

Best answer
3 votes
3 votes

1. n > (log n)log n 

take log on both side

we get logarithmic value of n is log n.............i

logarithmic value of (log n)log n  is log n(log log n)..................ii

Now put n=22^x

putting it in i we get log n =2x

putting it in ii we get (log n)log n  = log n(log log n) =2x . x

then n < (log n)log n 

2. take log in both the function

 2n taking log value will be n log 2 =n .................i

n√n taking log value will be √n log n ...................ii

again take n=2x

2n =n log 2 =taking n=2x value will be 2x ......................iii

n√n √n log n taking n=2x value will be 2x/2 . x ............iv

Here 2x > 2x/2 . x 

So, 2n > n√n

3. take log on both side

2  taking log value will be n

nlog n taking log value will be log n . log n =(log n)

Here too linear value of n will be greater than logarithmic value of (log n)2

So, 2n > nlog n

selected by
Answer:

Related questions

625
views
1 answers
1 votes
Sajal Mallick asked Nov 28, 2023
625 views
Consider the problem that given a set Sof n integers and another integer x, whether or not there exist two elements in S whose sum is exactly x. What is the worst ... in dynamic programming? Then complexity should be O(n^2).How O(n logn)?
223
views
0 answers
0 votes
322
views
1 answers
0 votes
NeelParekh asked Jul 27, 2023
322 views
If an array is split in the form of increasing and decreasing order then what is TC to find minimum element in the array?
500
views
1 answers
2 votes
h4kr asked Dec 30, 2022
500 views
What is the correct time complexity in $\theta()$ ?