search
Log In
1 vote
128 views

in Algorithms
edited by
128 views
3

A very different one..

 

0
Nice
0
Theta(nloglogn)

1 Answer

0 votes

We try to convert in master fome.

Related questions

2 votes
0 answers
1
203 views
Let f (n) = Ο(n), g(n) = Ω(n) and h(n) = θ(n). Then g(n) + f(n).h(n) is ______ A.) Ω(n) B.) θ(n2) C.) Ω(n2) D.) θ(n) How to do these type of questions ?
asked Jan 22, 2018 in Algorithms ashish pal 203 views
0 votes
2 answers
3
477 views
what if i take f(x) = sinx, g(x)= cosx? these two cant be compared. sinx cant be written as O(cosx) and also cosx cant be written as O(sinx) then B becomes invalid. plz verify
asked Dec 5, 2016 in Algorithms Anusha Motamarri 477 views
1 vote
1 answer
4
236 views
Let $f(n)$ = Ω(n) and g(n) = O(f(n)). Then g(n) = _______ [Assume n>0 ] (a.) Ω(n) (b.) O(n) (c.) θ(n) (d.) Ω(1) According to me, the answer should be (b.) since, f(n) has lowest bound n and g(n) has f(n) as upper bound. Answer given is (d.) I am confused about the answer.
asked Feb 1, 2016 in Algorithms Utk 236 views
...