The Gateway to Computer Science Excellence
0 votes
25 views
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 by (285 points) | 25 views
0
Small Oh and Big Oh have different definitions, they are clearly given in Cormen.
0

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

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
got it

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,558 answers
195,717 comments
101,589 users