in Algorithms
470 views
0 votes
0 votes
Is it true?

$an^{2} = O(n^{2})$  for a>0

Also, what is the difference between Small-oh and Big-oh?

Also, why we consider theta, omega as Big-oh sometimes, in the above problem, the answer is Big-theta but it is equal to big-oh. Why is it so?
in Algorithms
470 views

4 Comments

Small Oh and Big Oh have different definitions, they are clearly given in Cormen.
0
0

@goxul can you please verify that asymptotic equation given above.

0
0

https://en.wikipedia.org/wiki/Big_O_notation#Formal_definition

Look at this definition given here and see if what you are asking makes sense. If you still don't get it, I'll help you out. 

0
0
got it
0
0

Please log in or register to answer this question.