Ebooks Chapter 2 HOW TO SOLVE IT BY COMPUTER 2.6

Generation of the FIBONANCI

Deklarasi
n : integer
i  : integer
a[1..50]: integer

Deskripsi
Read n
for i <- 0 to n do
if (i<2)then
a[i]<-1
else 
        a[ i ] <- a[ i - 2 ] + a[ i - 1 ]
        end if
    end for
    For i <- 0 to n do
        Write a[ i ]
    end for
    end

flowchartnya :

c++ :

Output :