-2

What is the Big O class of the following expression:

$$2^{\log \log n}$$

I think the Big O is $2^n$ as I assume $\log \log n$ to be $n$. Is my assumption correct?

Raphael
  • 72,336
  • 29
  • 179
  • 389
Computernerd
  • 639
  • 2
  • 11
  • 17
  • 2
    Do you know what $\log$ means? – Amit Kumar Gupta Jul 18 '14 at 05:31
  • What have you tried towards proving your hypothesis? Also, there is no such thing as "the big O". Finally, this question requires high-school mathematics to answer (specifically, calculation laws of powers) and not computer science expertise. – Raphael Jul 18 '14 at 07:29
  • Do you know what an equation is? Using the right words and the right concepts is the beginning of understanding. – babou Jul 18 '14 at 07:50
  • "Big O value" is incorrect. You should say (at least) "Big O class". Furthermore, you seem to think there is only one such class. Do you understand what "Big O" means, even in the simpler cases. You should go back to your textbook. – babou Jul 18 '14 at 08:10
  • Someone asked that this question be reopened. But I do not know who asked, or why it was asked, as there is no comment about this reopening request. (cc @Raphael ). – babou Jul 18 '14 at 09:41
  • 2
    @babou You edited the question and that automatically nominates it for reopening. – David Richerby Jul 18 '14 at 09:46
  • 1
    @DavidRicherby Thanks David. I did not know. Furthermore, I was not aware it was put on hold while I was editing. This question is interesting only as a nice compendium of a variety of errors, both in substance and in style. – babou Jul 18 '14 at 09:57

1 Answers1

3

The big O (or rather, a big O) of $2^{\lg\lg n}$ is $O(2^{\lg\lg n})$. It is also $O(\log n)$, assuming $\lg$ is logarithm to base 2. Both expressions are tight, in the sense that in fact $2^{\lg\lg n} = \Theta(2^{\lg\lg n}) = \Theta(\log n)$.

The morale is that any expression can function as big O. We are usually aiming at a simple expressions, which is why we use $O(n^3)$ for $2n^3 + 15n\log$, for example. There are some canonical big O expressions, such as $O(n^a\log^b n)$. That means that if your function $f$ has order of growth $\Theta(n^a\log^b n)$, then you would usually describe it this way. Under this convention, a (tight) big O of $2^{\lg\lg n}$ is $O(\log n)$.

Yuval Filmus
  • 276,994
  • 27
  • 311
  • 503
  • 2
    I strongly recommend not writing "The big O", even though the phrase is taken from the question. The definite article implies uniqueness and the whole point of your answer is that it isn't unique. Normally, using little phrases from the question is good writing style but, in this case, I think it confuses the issue. (And this comment is only about writing style - I know you understand the mathematics.) – David Richerby Jul 18 '14 at 09:50
  • "assuming lg is logarithm to base 2" -- isn't it the same for any base? Exchanges of bases only yield constant factors. – Raphael Jul 18 '14 at 16:09
  • @Raphael Not in the exponent. – Yuval Filmus Jul 18 '14 at 16:19