|
import extensions;
|
|
|
|
fibu(n)
|
|
{
|
|
int[] ac := new int[]::( 0,1 );
|
|
if (n < 2)
|
|
{
|
|
^ ac[n]
|
|
}
|
|
else
|
|
{
|
|
for(int i := 2, i <= n, i+=1)
|
|
{
|
|
int t := ac[1];
|
|
ac[1] := ac[0] + ac[1];
|
|
ac[0] := t
|
|
};
|
|
|
|
^ ac[1]
|
|
}
|
|
}
|
|
|
|
public program()
|
|
{
|
|
for(int i := 0, i <= 10, i+=1)
|
|
{
|
|
console.printLine(fibu(i))
|
|
}
|
|
}
|