[a,b]i = a
if a MOD 2 != 0
i = i + 1
while i <= b
write i
i = i + 2
n
- tej liczby Fibonacciego
n ∈ N
f0 = 0
f1 = 1
for i = 0 to n
if i > 1
f = f0 + f1
f0 = f1
f1 = f
else
f = i
w ∈ R
T; T[i] ∈ R
for i = 1 to T.lenght
T[i] = w
T; T[i] ∈ R
suma = 0
for i = 1 to T.lenght
suma = suma + T[i]
e
do tablicy T
na daną pozycję n
T; T[i] ∈ R
e ∈ R
n ∈ N
T.lenght = T.lenght + 1
for i = n to T.lenght
nPom = T[i + 1]
T[i + 1] = T[i]
if i == n
T[i] = e
else
T[i] = sPom
sPom = nPom