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.

Ancestors (5)

  1. Asymptotic analysis
  2. Mathematical analysis
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version