I hate you, Fibonacci!

[Random Variable]

I took me forever to write a simple program using Maple that would sum the first n terms of the Fibonacci sequence. My programming skills suck. 😱 Would anyone have done it differently?

EDIT: I apologzie for the lack of spacing but FuseTalk sucks at spacing.

Fibon:=proc(n)
local s, F1, F2, F3, k;

if n=1 then
print(0);

elif n=2 then
print(1);

else
s:=1;
F1:=0;
F2:=1;
for k from 3 to n do
s:=s+F1+F2;
F3:=F1+F2
F1:=F2;
F2:=F3;

end do;

print(s);

end if;

end proc;

 

[statik213]

Wrong forum move to -> Software.

anywayz, wot language is this?

 

[EyeMWing]

Well, I know I had no problem doing that in java. But uh, wtf is that sh!t? TI_BASIC?

 

[walla]

if i remember correctly, you can do this as a recursive program, which will save on the amount of code -- however, may not be as computationally efficient.

 

[fleshconsumed]

You did an iterative version which runs linear runtime. A recursive version is somewhat shorter, but has exponential runtime. Just stick at what you have right now.

 

[Anubis]

11235813.......