title: Is this algorithm O(log log n) complexity?
body: <p>In particular, I'm interested in finding the Theta complexity. I can see the algorithm is bounded by log(n) but I'm not sure how to proceed considering the problem size decreases <em>exponentially</em>.  </p>
  
  <pre><code>i = n
  j = 2
  while (i &gt;= 1)
      i = i/j
      j = 2j
  </code></pre>