title: Time Complexity of Fibonacci Algorithm
body: <p>So, i've got a recursive method in Java for getting the 'n'th fibonacci number - The only question i have, is: what's the time complexity? I think it's O(2^n), but i may be mistaken? (I know that iterative is way better, but it's an exercise)</p>
  
  <pre><code>public int fibonacciRecursive(int n)
  {
      if(n == 1 || n == 2) return 1;
      else return fibonacciRecursive(n-2) + fibonacciRecursive(n-1);
  }
  </code></pre>