O(Log

Logarithmic time complexity in computer science.

logarithmic time complexity O(log n)

O(log n) is a notation in computer science that describes the logarithmic time complexity of an algorithm, meaning the number of operations grows logarithmically with the size of the input.

/oʊ ˈlɒɡ/

Derived from the mathematical concept of logarithms, it was adopted to describe algorithm efficiency.

logarithmic time complexity

time complexity computational complexity

O(log log n) O(log^2 n)

algorithm analysis computational efficiency

computer science mathematical symbol