educative.io

Big O and Big Omega

It is a common misconception that Big O characterizes 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.

Hi I would like to know what this means ?

This means that Asymptotic Notations and worst/best case runtimes are two separate things and cannot be interrelated.

The two are independent of each other.