Other Common Asymptotic Notations and Why Big O Trumps Them
This lesson covers the various asymptotic notations for algorithms and why computer scientists prefer Big O instead of other notations.
Big ‘Omega’ -
Mathematically, a function is in if there exists a real constant and there exists such that for . In other words, for sufficiently large values of , will grow at least as fast as .
It is a common misconception that Big O characterizes the worst-case running time while Big Omega characterizes the best-case running time of an algorithm. There is no one-to-one relationship between any of the cases and the asymptotic notations.
The following graph shows an example of functions and that have a Big Omega relationship:
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.