` Classical fibonaci algorithm
` Recursive algorithm
constant int fibmax = 16
int z = 0
` recursive Fibonacci function
int fib(int n)
if n <= 1 : z = n
else
z = 0 + fib(n - 1) + fib(n - 2)
/if
return z
for int i in 0..fibmax
print "fib($i)=" , fib(i)
/for