( ( ) (nthere exists and such that ( < (nfor all omega notationo the notation (nis the formal way to express the lower bound of an algorithm' running time it measures the best case time complexity or the best amount of time an algorithm can possibly take to complete for examplefor function (no( ( )> (nthere exists and such that ( < (nfor all theta notationth the notation th(nis the formal way to express both the lower bound and the upper bound of an algorithm' running time it is represented as followsth( ( ) (nif and only if (nn ( ( )and (no( ( )for all