Question

I’m sitting here with this assignment in a course on algorithms with massive data sets and the use of Little-Oh notation has got me confused, although I’m perfectly confident with Big-Oh.

I do not want a solution to the assignment, and as such I will not present it. Instead my question is how I interpret the time complexity o(log n)?

I know from the definition, that an algorithm A must grow asymptotically slower than o(log n), but I’m uncertain as to whether this means that the algorithm must be running in constant time or if it is still allowed to be log n under certain conditions, such that c = 1 or if it is really log (n-1).

Say an algorithm has a running time of O(log n) but in fact does two iterations and as such c = 2, but 2*log n is still O(log n), am I right when I say that this does not hold for Little-Oh?

Any help is greatly appreciated and if strictly needed for clarification, I will provide the assignment

Answer 1

To say the f is ‘little-oh-of g’ f = o(g), means that the quotient

|f(x)/g(x)|

approaches 0 as x approaches infinity. Referring to your example of o(log n), that class contains functions like log x / log (log x), sqrt(log x) and many more, so o(log x) definitely doesn’t imply O(1). On the other hand, log (x/2) = log x - log 2, so

log (x/2) / log x = 1 - log 2 / log x -> 1

and log (x/2) is not in the class o(log x).