title: Primer Method Big-O Complexity
body: <p>When you are considering the complexity of a method that calls a recursive method (a primer method), do you consider the complexity of the recursive method, or just consider the call of the method.</p>
  
  <p>For example, I have a small program that calculates a fibonacci sequence:</p>
  
  <pre><code>// Complexity: ???
  public int fib() {
      int n = 9;
      return fib(n);
  }
  
  
  // Complexity: O(2^n)
  private int fib(int n) {
      if (n &lt;= 1)
          return n;
      return fib(n-1) + fib(n-2);
  }
  </code></pre>
  
  <p>The complexity of the recursive <code>fib(int n)</code> method is <code>O(2^n)</code>, but I am not sure what the complexity of <code>fib()</code> would be.</p>
  
  <p>My assumption is that it is complexity 1 because all it does is define and int and return a number.</p>