FIB-2 (n)
k<-2
F0<-0
F1<-1
while k<=n
do Fk<-F0 + F1
F0<-F1
F1<-Fk
k<-k + 1
return Fk

FIB-1 (n)
k<-2
F[0]<-0
F[1]<-1
while k<=n
do F[k]<-F[k-1] + F[k-2]
k<-k + 1
return F[n]

FIB (n)
if n = 0
then FIB‹- 0
else if n = 1
then FIB‹- 1
else FIB‹- FIB(n-1)+FIB(n-2)

HANOI(n;X;Y;Z)
if n = 1
then X->Y
else HANOI(n-1,X,Z,Y)
X->Y
HANOI(n-1;Z;Y;X)