Algorithm
1. Start
2.
Declaration
of value, Fibo, the limitIn this case it takes:
value = values [i].
Fibo as an array
Number as the sum of all numbers fibonanci.
Limit as a limit to the end of a process carried out.
3.
set the limit at 0 (limit = 0).
4. number in the set 0 (number = 0).
5. Enter a numerical value [Fibo]
6. if a large boundary = value [Fibo] then:
7.
if yes then will proceed to step 11, otherwise it
will be the next step.
8. if large extent <= 1 then:
9.
if yes then will it be to step 9 and, if not it will kelangkah.
10. add the variables a and b tambahanvariabel
11. a = 0
12. numbers [Fibo] =
limit
13. directly to step 16
14. B = a.
15. a = number [Fibo]
16. numbers [Fibo] =
a + b
17. jumlah = number
+ numbers [Fibo]
18. print number fibonanci;
19. limit = limit + 1
20. back to step 5
21. print the sum of all numbers fibonanci
22. completed
