Fib(n)
{
If (n<2)
return 1;
Int fib0=1,fib1=1,num=1;
while (num<=n)
{
a=a+b;
b=b+a;
num+=2;
}
If (num==n)
return b;
else
return a;
}
Fib(n)
{
If (n<2)
return 1;
Int fib0=1,fib1=1,num=1;
while (num<=n)
{
a=a+b;
b=b+a;
num+=2;
}
If (num==n)
return b;
else
return a;
}