in Algorithms retagged by
516 views
1 vote
1 vote

I was surfing internet and I got this beautiful Problem, I thought i should post here.

in Algorithms retagged by
by
516 views

1 Answer

0 votes
0 votes
a)true

b)false//////it should not contain tighest upper bound...if it is o(n^52)...it would have been true

c) true

d)true

e)false///same reason as (b)

f) false/////it should be big-oh

g) true

h) false////it should be omega

i)true

j)true

k)false////it should be big-oh

l)false ////both are equal using log properties...therefore theta should be there
reshown by

2 Comments

Dude, If you are writing an answer, then write it with some detail explanation. No body want a expert view. Please explain in details.
0
0

Rude, ok  from now onwards...i will follow ur suggestionssmiley

0
0