Hi,
how is possible to implement in a patch an iterative algorithm, similar at the "do-while" loop?

For example:

generate the Fibonacci Numbers.
The algorithm is this:
F(1)=1
F(2)=1
F(n)=F(n-1)+F(n-2) n>=3

Output: 1,1,2,3,5,8,13,....
is sent in a number box, with a metro.
I would choose when must stop the cycle.

Any suggestions?
Other examples of recursive algorithms in pd?
Thank's..

t.

Short answer: use [int] of [float] boxes to store variables, then use [triggers] to route everything around in proper order of execution.

Here's an example...

http://www.pdpatchrepo.info/hurleur/fibber.pd

Thank you!!!

t.

you can also define a patch, and use the patch within itself. Another short answer.

@sunji said:

you can also define a patch, and use the patch within itself. Another short answer.

Could you show an example of that?

Um, this is what I meant, but upon examination, it seems pd is resistant to invoking this subroutine as it climbs up the abstraction level. Someone care to troubleshoot? This kind of recursion could help extend pd towards objectorientation, if that's a desirable thing.

http://www.pdpatchrepo.info/hurleur/selfrecurs.pd