title: what is the complexity of this algorithm , can i sum it to infinity?
body: <pre><code>Func(n)
  {
     i = n
     while(i&gt;=1)
        g(i);
        i = i/3;
  }
  </code></pre>
  
  <p>what is the complexity of this algorithm?
  (while the complexity of g(n) is theta(n²))
  I assumed for bigger n's you say that the complexity is</p>
  
  <p>n² + (n/3)² + (n/3²)² + (n/3³)²..... to infinity.</p>
  
  <p>And the answer is theta(n²).
  Is that true?</p>