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? Algorithms asymptotic-notation + – nishant_magarde asked Mar 21, 2019 nishant_magarde 486 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply goxul commented Mar 22, 2019 reply Follow Share Small Oh and Big Oh have different definitions, they are clearly given in Cormen. 0 votes 0 votes nishant_magarde commented Mar 22, 2019 reply Follow Share @goxul can you please verify that asymptotic equation given above. 0 votes 0 votes goxul commented Mar 22, 2019 reply Follow Share 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 votes 0 votes nishant_magarde commented Mar 22, 2019 reply Follow Share got it 0 votes 0 votes Please log in or register to add a comment.