Hands-On High Performance with Go

O(log n) - logarithmic time

Logarithmic growth is often represented as a partial sum of the harmonic series. This can be represented as follows:

An algorithm written in logarithmic time has a number of operations that tend toward zero as the size of the input decreases. An O(log n) algorithm cannot be used in an algorithm when all of the elements in the array must be accessed. O(log n) is usually considered an efficient algorithm when it is used by itself. One important concept to think about with respect to performance in logarithmic time is that search algorithms are commonly used with sort algorithms, which adds to the complexity of finding ...