title: printing fibonacci number series without using loops
body: <p>Is there a hack to print the first n fibonacci numbers without calling a loop</p>
  
  <pre><code>for(int i=1; i&lt;n; i++)
      System.out.println(computeF(n));
  </code></pre>
  
  <p>from the main program?</p>
  
  <pre><code>public static int computeF(int n)
  {
      if(n==0)
      {
          return 0;
      }
      else if(n==1)
      {
          return 1;
      }
      else
      {
          return computeF(n-1)+computeF(n-2); 
      }
  
  }
  </code></pre>
  
  <p>There might be a way to print the intermediate values in recursion which will print the fibonacci numbers. </p>