L-notation

L-notation, or "Big L notation," is a method used in algorithm analysis to describe the limiting behavior of functions. It is particularly useful in the context of analyzing the time or space complexity of algorithms, similar to Big O notation, but it focuses on lower bounds instead of upper bounds.