title: Is this an algorithm with O(4^n) complexity?
body: <p>I am given a question to write a method with a time complexity of O(4^n).</p>
  
  <p>I have came out with this algorithm:</p>
  
  <pre><code>public void test(int n){
     for(int i = 0; i&lt;n;i++){
        test(4*i);
     }
  }
  </code></pre>
  
  <p>Is this be considered to be running on O(4^n)?</p>