Print Fibonacci Series

public static int fibonacci2(int number)

{

 if(number == 1 || number == 2)

{ return 1; }

 int fibo1=1, fibo2=1, fibonacci=1; 

for(int i= 3; i<= number; i++)

{ 

 fibonacci = fibo1 + fibo2;  //Fibonacci number is sum of previous two Fibonacci number 

 fibo1 = fibo2;

 fibo2 = fibonacci; 

}

 return fibonacci; //Fibonacci number 

}

}

(OR)

public static int fibonacci(int number)

{

 if(number == 1 || number == 2)

{ return 1; } 

return fibonacci(number-1) + fibonacci(number -2); //tail recursion 

}