points = new Array();
function (__structure Point_struct) main ()
{
var result = new Object();
recurs(10);
result.Point_struct = points;
return result;
}
function recurs( p1 ) {
points = new Array();
for( var i = 0; i < p1; i++ ) {
points.push( p1 - i );
}
}
I personally wouldn't let the recurs method run in the main function, but let it be triggered by a pulse somewhere.
)
I personally wouldn't let the recurs method run in the main function, but let it be triggered by a pulse somewhere.
This example doesn't contain recursion... My task is actually to build an L-tree by means of QC just like in this link http://processing.org/learning/topics/tree.html
http://kineme.net/forum/Programming/iniTreedrawyourownrecursiontree like this?
Yes, this is exactly it. But I wanted to program this algorhythm using Javascript patch.