1. package tom.example.code;
public class Fibonacci {
public static void main(String[] args) {
Fibonacci fibonacci = new Fibonacci();
for(int n = 1; n <= 46; n += 5)
{
fibonacci.iFibonnaci = 0;
fibonacci.value(n);
System.out.println("n:" + n + " F:" +
fibonacci.calculations(n) + " Value: " + fibonacci.value(n) );
}
}
public long iFibonnaci = 0;
public int calculations(int n)
{
iFibonnaci++;
if(n == 0)
{
return 0;
}
else if(n == 1)
{
return 1;
}
else
{

2. return calculations(n-1) + calculations(n-2);
}
}
public long value(int n)
{
long last = 0L, next = 1L;
int iCalculations = 0;
while(iCalculations < n)
{
iCalculations++;
long nextN = next + last;
last = next;
next = nextN;
}
return next;
}
}