title: Is O(n) greater than O(2^log n)
body: <p>I read in a data structures book complexity hierarchy diagram that n is greater than 2<sup>log n</sup>. But cannot understand how and why. On using simple examples in power of 2 as n, I get values equal to n.</p>
  <p>It is not mentioned in book , but I am assuming it to base 2 ( as context is DS complexity)</p>
  <blockquote>
  <p>a) Is <code>O(n) &gt; O(pow(2,logn))</code>?</p>
  <p>b) Is <code>O(pow(2,log n))</code> better than <code>O(n)</code>?</p>
  </blockquote>