Assuming iterated logarithm is defined as it is here: http://en.wikipedia.org/wiki/Iterated_logarithm
How should I go about comparing its complexity to other functions, for example lg(lg(n))
? So far I've done all the comparing by calculating the limits, but how do you calculate a limit of iterated logarithm?
I understand it grows very slowly, slower than lg(n)
, but is there some function that grows at the same speed maybe as lg*(n)
(where lg*
is iterated logarithm on base 2) so it would ease comparing it to other functions? This way I could also compare lg*(lg(n))
to lg(lg*(n))
for example. Any tips on comparing functions to each other based on speed of growing would be appreciated.