The Big Omega () notation is a method of expressing the lower bound on the growth rate of an algorithm’s running time. In other words we can say that it is the minimum amount of time, an algorithm could possibly take to finish it therefore the “big-Omega” or -Notation is used for best-case analysis of the algorithm.