L-notation is an asymptotic notation analogous to big-O notation, denoted as for a bound variable 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.
![{\displaystyle L_{n}[\alpha ,c]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/4bc08a186e75571e0bee47eaafc610206275f961)
