Big-Omega notation

Big-Omega notation is said to be the best case runtime of an algorithm. However formally it is simply a lower bound on the run time - the same as Big-O notation is simply an upper bound. This has a similar formal definition This is just saying that eventually is at least a scalar multiple of .