Java:
public static long fib(final int n)
{
if (n <= 2)
{
return (n > 0) ? 1 : 0;
}
long fib1 = 0;
long fib2 = 1;
for (int i = 1; i < n; i++)
{
final long newFib = fib1 + fib2;
fib1 = fib2;
fib2 = newFib;
}
return fib2;
}
public static long fib(final int n)
{
if (n <= 2)
{
return (n > 0) ? 1 : 0;
}
return fib(n - 1) + fib(n - 2);
}