L-notation is an asymptotic notation analogous to big-O notation, denoted as L n [ α , c ] {\displaystyle L_{n}[\alpha ,c]} for a bound variable n {\displaystyle n} tending to infinity. Like big-O notation, it is usually used to roughly convey the rate of growth of a function, such as the computational complexity of a particular algorithm.