algorithm - What's the difference between big O and big Omega? -


big omega supposed opposite of big o, can have same value, because definition big o means:

g(x) cg(x) bigger or equal f(x) 

and big omega means

g(x) cg(x) smaller or equal f(x)

the thing changes value of c, if value of c arbitrary value (a value choose meet inequality), big omega , big o same. what's point of two? purpose serve?

big o bounded above (up constant factor) asymptotically while big omega bounded below (up constant factor) asymptotically.

mathematically speaking, f(x) = o(g(x)) (big-oh) means growth rate of f(x) asymptotically less or equal to growth rate of g(x).

f(x) = Ω(g(x)) (big-omega) means growth rate of f(x) asymptotically greater or equal growth rate of g(x)

see wiki reference below:

big o notation

enter image description here


Comments

Popular posts from this blog

c# - DetailsView in ASP.Net - How to add another column on the side/add a control in each row? -

javascript - firefox memory leak -

Trying to import CSV file to a SQL Server database using asp.net and c# - can't find what I'm missing -